Achieving the Superposition and Binning Regions for Broadcast Channels Using Polar Codes

[1]  Rüdiger L. Urbanke,et al.  Universal polar codes , 2013, 2014 IEEE International Symposium on Information Theory.

[2]  Chandra Nair,et al.  On Marton's Inner Bound and Its Optimality for Classes of Product Broadcast Channels , 2014, IEEE Transactions on Information Theory.

[3]  Junya Honda,et al.  Polar Coding Without Alphabet Extension for Asymmetric Models , 2013, IEEE Transactions on Information Theory.

[4]  Jungwon Lee,et al.  Achieving the Uniform Rate Region of Multiple Access Channels Using Polar Codes. , 2013 .

[5]  Michael Gastpar,et al.  Polar Codes for Broadcast Channels , 2013, IEEE Transactions on Information Theory.

[6]  Emre Telatar,et al.  Polar Codes for the Two-User Multiple-Access Channel , 2010, IEEE Transactions on Information Theory.

[7]  Shlomo Shamai,et al.  Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels , 2010, IEEE Transactions on Information Theory.

[8]  Alexander Vardy,et al.  Constructing polar codes for non-binary alphabets and MACs , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[9]  Onur Ozan Koyluoglu,et al.  Polar coding for secure transmission and key agreement , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[10]  Michael Gastpar,et al.  Polar Codes for the Deterministic Broadcast Channel , 2012 .

[11]  Sriram Vishwanath,et al.  Polar alignment for interference networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[13]  Eren Sasoglu,et al.  Polar codes for the two-user binary-input multiple-access channel , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[14]  Alexander Vardy,et al.  Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes , 2010, IEEE Transactions on Information Theory.

[15]  Rüdiger L. Urbanke,et al.  Polar Codes are Optimal for Lossy Source Coding , 2009, IEEE Transactions on Information Theory.

[16]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[17]  Rüdiger L. Urbanke,et al.  The compound capacity of polar codes , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[19]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[20]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[21]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[22]  R. Gallager.  Information Theory and Reliable Communication , 1968 .