Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels

Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric.

[1]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

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

[4]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[5]  Rüdiger L. Urbanke,et al.  Polar codes: Characterization of exponent, bounds, and constructions , 2009, 2009 IEEE International Symposium on Information Theory.

[6]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[7]  Yuan Zhou Introduction to Coding Theory , 2010 .

[8]  Erdal Arıkan Two-dimensional polar coding , 2009 .

[9]  Toshiyuki Tanaka,et al.  Channel polarization on q-ary discrete memoryless channels by arbitrary kernels , 2010, 2010 IEEE International Symposium on Information Theory.

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

[11]  Uri Erez,et al.  Transmission over arbitrarily permuted parallel Gaussian channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[13]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[14]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[15]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[16]  Ron M. Roth,et al.  Introduction to Coding Theory , 2019, Discrete Mathematics.

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

[18]  Eren Sasoglu,et al.  A class of transformations that polarize binary-input memoryless channels , 2009, 2009 IEEE International Symposium on Information Theory.

[19]  Alexei Gorokhov,et al.  Signaling Over Arbitrarily Permuted Parallel Channels , 2008, IEEE Transactions on Information Theory.