Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels Academic Article uri icon

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.

published proceedings

  • IEEE Transactions on Information Theory

author list (cited authors)

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

publication date

  • January 1, 2013 11:11 AM