The two-user broadcast packet erasure channel with feedback and memory

The two-user broadcast erasure channel with feedback and memory is analyzed. It is shown that memory increases the capacity region for this scenario. Several heuristic algorithms are proposed and analyzed. Although these schemes do not achieve capacity, significant gains can be observed compared to the memoryless case.

[1]  E. O. Elliott Estimates of error rates for codes on burst-noise channels , 1963 .

[2]  Xiaohang Song,et al.  Network coding for the broadcast Rayleigh fading channel with feedback , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[3]  Leandros Tassiulas,et al.  Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms , 2010, IEEE Transactions on Information Theory.

[4]  M.A.R. Chaudhry,et al.  Efficient algorithms for Index Coding , 2008, IEEE INFOCOM Workshops 2008.

[5]  David James Love,et al.  Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[6]  Andrea J. Goldsmith,et al.  Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation , 2010, IEEE Transactions on Information Theory.

[7]  H. Marko,et al.  The Bidirectional Communication Theory - A Generalization of Information Theory , 1973, IEEE Transactions on Communications.

[8]  Leandros Tassiulas,et al.  Broadcast erasure channel with feedback - Capacity and algorithms , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[9]  Parastoo Sadeghi,et al.  Adaptive network coding for broadcast channels , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[10]  Israel Bar-David,et al.  Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[11]  E. Gilbert Capacity of a burst-noise channel , 1960 .

[12]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[13]  Chih-Chun Wang On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback , 2012, IEEE Trans. Inf. Theory.

[14]  Chih-Chun Wang,et al.  On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback , 2010, IEEE Transactions on Information Theory.

[15]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[16]  L. Keller,et al.  Online Broadcasting with Network Coding , 2008, 2008 Fourth Workshop on Network Coding, Theory and Applications.

[17]  J. Massey CAUSALITY, FEEDBACK AND DIRECTED INFORMATION , 1990 .