Polar codes for q-ary channels, q=2^r
Woomyoung Park, Alexander Barg

TL;DR
This paper extends polar coding techniques to q-ary channels with sizes as powers of two, proving convergence of virtual channels and providing an explicit scheme with favorable error decay.
Contribution
It demonstrates polarization for nonbinary channels with q=2^r using Arikan's kernel, establishing convergence to channels with capacities up to r bits and an explicit coding scheme.
Findings
Virtual channels converge to capacities 1 to r bits.
Transmission rate approaches symmetric capacity.
Decoding error probability decays as exp(-N^α) for α<0.5.
Abstract
We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's polarizing kernel H_2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with capacity 1,2,...,r bits, and that the total transmission rate approaches the symmetric capacity of the channel. This leads to an explicit transmission scheme for q-ary channels. The error probability of decoding using successive cancellation behaves as exp(-N^\alpha), where N is the code length and {\alpha} is any constant less than 0.5.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Error Correcting Code Techniques · Cooperative Communication and Network Coding
