Network Coding and Wireless Physical-layer ... - Jacobs University
Network Coding and Wireless Physical-layer ... - Jacobs University
Network Coding and Wireless Physical-layer ... - Jacobs University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
CONTENTS<br />
v<br />
3.3 Introduction to <strong>Network</strong> <strong>Coding</strong> . . . . . . . . . . . . . . . . . . . . . . . . 24<br />
3.4 Theory of <strong>Network</strong> <strong>Coding</strong> . . . . . . . . . . . . . . . . . . . . . . . . . . . 26<br />
3.4.1 Linear <strong>Network</strong> Codes . . . . . . . . . . . . . . . . . . . . . . . . . 28<br />
II<br />
<strong>Network</strong> <strong>Coding</strong> Issues: Unequal Erasure Protection <strong>and</strong><br />
Degree Distribution Distortion in LT-Coded Symbols 32<br />
4 Unequal Erasure Protection (UEP) in <strong>Network</strong> <strong>Coding</strong> 34<br />
4.1 Introduction to Erasures <strong>and</strong> Unequal Erasure Protection (UEP) in <strong>Network</strong><br />
<strong>Coding</strong> . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34<br />
4.2 The Edge-Disjoint Path Model with Binary Erasure Channels for <strong>Network</strong><br />
<strong>Coding</strong> . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36<br />
4.3 UEP Issues in <strong>Network</strong> <strong>Coding</strong> . . . . . . . . . . . . . . . . . . . . . . . . 37<br />
4.4 The Utility of Scalable Data . . . . . . . . . . . . . . . . . . . . . . . . . . 38<br />
4.5 Utility of Scalable Data as Probabilistic Objects . . . . . . . . . . . . . . . 41<br />
4.6 Utility of Global Encoding Kernels (GEKs) for Linear <strong>Network</strong> Codes . . . 42<br />
4.7 The Problem of GEK Assignment . . . . . . . . . . . . . . . . . . . . . . . 46<br />
4.8 Subtree Decomposition Technique for Complexity Reduction of the GEK<br />
Assignment Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47<br />
4.9 Minimax Assignment of Global Encoding Kernels (GEKs) . . . . . . . . . 49<br />
4.10 An Ascending-bid Auction Algorithm for GEK Allocation . . . . . . . . . 51<br />
4.11 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56<br />
5 <strong>Network</strong> <strong>Coding</strong> with LT Codes as Erasure Codes 58<br />
5.1 Introduction <strong>and</strong> the System Model of Relay <strong>Network</strong> Multicast with LT<br />
<strong>and</strong> <strong>Network</strong> Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59<br />
5.2 Related Literature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61<br />
5.3 LT <strong>and</strong> <strong>Network</strong> Encoding <strong>and</strong> Decoding . . . . . . . . . . . . . . . . . . . 62