Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels

abstract

• 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. 1963-2012 IEEE.

authors

• Tian, Chao

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

altmetric score

• 6

author list (cited authors)

• Hof, E., Sason, I., Shamai (Shitz), S., & Tian, C.

citation count

• 11

complete list of authors

• Hof, Eran||Sason, Igal||Shamai (Shitz), Shlomo||Tian, Chao

publication date

• March 2013

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Capacity-achieving Codes
• Maximum Distance Separable (mds) Codes
• Parallel Channels
• Polar Codes
• Stochastically Degraded Channels

Digital Object Identifier (DOI)

• 10.1109/TIT.2012.2236971

start page

• 1505

end page

• 1516

volume

• 59

issue

• 3

URL

• http://dx.doi.org/10.1109/tit.2012.2236971