By Topic

Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hof, E. ; Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa, Israel ; Sason, I. ; Shamai, S. ; Chao Tian

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 3 )