Linear Network Error Correction Coding

Zhen Zhang

ISBN 10: 1493905872 / ISBN 13: 9781493905874

Editore: Springer New York, Springer US Mär 2014, 2014

Riguardo questo articolo

Neuware -There are two main approaches in the theory of network error correction coding. In this SpringerBrief, the authors summarize some of the most important contributions following the classic approach, which represents messages by sequencessimilar to algebraic coding,and also briefly discuss the main results following theother approach,that uses the theory of rank metric codes for network error correction of representing messages by subspaces.This book starts by establishing the basic linear network error correction (LNEC) model and then characterizes two equivalent descriptions. Distances and weights are defined in order to characterize the discrepancy of these two vectors and to measure the seriousness of errors. Similar to classical error-correcting codes, the authors also apply the minimum distance decoding principle to LNEC codes at each sink node, but use distinct distances. For this decoding principle, it is shown that the minimum distance of a LNEC code at each sink node can fully characterize its error-detecting, error-correcting and erasure-error-correcting capabilities with respect to the sink node. In addition, some important and useful coding bounds in classical coding theory are generalized to linear network error correction coding, including the Hamming bound, the Gilbert-Varshamov bound and the Singleton bound. Several constructive algorithms of LNEC codes are presented, particularly for LNEC MDS codes, along with an analysis of their performance. Random linear network error correction coding is feasible for noncoherent networks with errors. Its performance is investigated by estimating upper bounds on some failure probabilities by analyzing the information transmission and error correction. Finally, the basic theory of subspace codes is introduced including the encoding and decoding principle as well as the channel model, the bounds on subspace codes, code construction and decoding algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 116 pp. Englisch.

Codice articolo 9781493905874

Dati bibliografici

• Titolo: Linear Network Error Correction Coding
• Editore: Springer New York, Springer US Mär 2014
• Data di pubblicazione: 2014
• Lingua: Inglese
• ISBN 10: 1493905872
• ISBN 13: 9781493905874
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 7 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 7 millimetri di profondità
• Peso: 189 grammi

Descrizione articolo

Riassunto

There are two main approaches in the theory of network error correction coding. In this SpringerBrief, the authors summarize some of the most important contributions following the classic approach, which represents messages by sequences similar to algebraic coding, and also briefly discuss the main results following the other approach, that uses the theory of rank metric codes for network error correction of representing messages by subspaces. This book starts by establishing the basic linear network error correction (LNEC) model and then characterizes two equivalent descriptions. Distances and weights are defined in order to characterize the discrepancy of these two vectors and to measure the seriousness of errors. Similar to classical error-correcting codes, the authors also apply the minimum distance decoding principle to LNEC codes at each sink node, but use distinct distances. For this decoding principle, it is shown that the minimum distance of a LNEC code at each sink node can fully characterize its error-detecting, error-correcting and erasure-error-correcting capabilities with respect to the sink node. In addition, some important and useful coding bounds in classical coding theory are generalized to linear network error correction coding, including the Hamming bound, the Gilbert-Varshamov bound and the Singleton bound. Several constructive algorithms of LNEC codes are presented, particularly for LNEC MDS codes, along with an analysis of their performance. Random linear network error correction coding is feasible for noncoherent networks with errors. Its performance is investigated by estimating upper bounds on some failure probabilities by analyzing the information transmission and error correction. Finally, the basic theory of subspace codes is introduced including the encoding and decoding principle as well as the channel model, the bounds on subspace codes, code construction and decoding algorithms.

Recensione

From the book reviews:

“This short book on linear network error-correcting codes is a timely introductory review of a specific area of NC. ... for subject experts, it does provide quick reading material on the main concepts in network error correction. Readers can quickly grasp the new research area and start working on problems of interest.” (Manish Gupta, Computing Reviews, December, 2014)