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.
This book presents a unified and intuitive overview of the theory, applications, challenges, and future directions of this emerging field, and is a must-have resource for those working in wireline or wireless networking. • Uses an ...
This text offers both "classical" coding theory-such as Hamming, BCH, Reed-Solomon, Reed-Muller, and convolutional codes-as well as modern codes and decoding methods, including turbo codes, LDPC codes, repeat-accumulate codes, space time ...
Error. Correction. Codes. in. Packet. Networks. By a News Reporter-Staff News Editor at Information Technology ... By this proof, an algorithm is proposed to construct general linear network error correction codes including the linear ...
Provides a tutorial on the basics of network coding theory. Divided into two parts, this book presents a unified framework for understanding the basic notions and fundamental results in network coding.
Cai, N., Yeung, R.W.: Network coding and error correction. In: Proc. IEEE Inform. ... Inf. Theory 54(8), 2596–2603 (2008) Lima, L., Médard, M., Barros, J.: Random linear network coding: A free cipher? In: IEEE Intl. Symp. Inf. Theory.
Yeung and Cai [8] constructed such a linear network code with error-correcting capabilities. In erroneous network channels, Network Error Correction can be applied so that errors occurring in the network can be detected and corrected.
Estimate of the number of signals in error correcting codes. Dokl. Acad. ... Rate regions for coherent and noncoherent multisource network error correction. In Proc. ... Generalized Hamming Weight for linear codes. IEEE Trans. Infiorm.
Error correcting coding is often analyzed in terms of its application to the separate levels within the data network in isolation from each other.
Xuan, G., Fu, F.W., Zhang, Z.: Construction of network error correction codes in packet networks. In: International Symposium on Networking Coding, pp. 1–6 (2011) Yang, S., Chi, K.N., Yeung, R.W.: Construction of linear network codes ...
Finally, network coding can be seen as a highly significant tool for joint source-network coding since it allows an ... [BAL 09] BALLI H., YAN X., ZHANG 2., “On randomized linear network codes and their error correction capabilities”, ...