Network Coding TheoryNetwork Coding Theory provides a tutorial on the basic of network coding theory. It presents the material in a transparent manner without unnecessarily presenting all the results in their full generality. Store-and-forward had been the predominant technique for transmitting information through a network until its optimality was refuted by network coding theory. Network coding offers a new paradigm for network communications and has generated abundant research interest in information and coding theory, networking, switching, wireless communications, cryptography, computer science, operations research, and matrix theory. The tutorial is divided into two parts. Part I is devoted to network coding for the transmission from a single source node to other nodes in the network. Part II deals with the problem under the more general circumstances when there are multiple source nodes each intending to transmit to a different set of destination nodes. Network Coding Theory presents a unified framework for understanding the basic notions and fundamental results in network coding. It will be of interest to students, researchers and practitioners working in networking research. |
Contents
Introduction | 1 |
Acyclic Networks | 11 |
5 | 44 |
Cyclic Networks | 51 |
Network Coding and Algebraic Coding | 73 |
Superposition Coding and MaxFlow Bound | 81 |
9 | 89 |
18 | 98 |
40 | 104 |
Fundamental Limits of Linear Codes | 117 |
Acknowledgements | 133 |
Common terms and phrases
2005 IEEE International achievable information rate acyclic network Algorithm 2.19 Annual Allerton Conference base field codeword sent communication network Conference on Communication convolutional network code cyclic network Definition denote Effros encoding mappings Example fe(z field F finite field global encoding kernels IEEE IEEE International Symposium IEEE Trans imaginary channels In(T inequality information rate region information rate tuple information source Information Theory inner bound Koetter Lemma linear block code linear broadcast linear codes linear dispersion linear network code linearly independent matrix max-flow bound Max-flow Min-cut theorem Medard multi-source network coding NetCod network coding problem network in Figure non-source node Out(T outer bound polynomial positive integer proof R. W. Yeung random coding random variables Riva del Garda scalar values Sept Singleton bound sink node source coding theorem source node sufficiently large superposition coding Symposium on Information Uab Y1 ubc Y2 y₁
Popular passages
Page 145 - ER Berlekamp, Block coding for the binary symmetric channel with noiseless, delayless feedback, In: Error-correcting Codes, HB Mann (Editor), Wiley, New York (1968), pp.