Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels

2010/01/15 by Ryuhei Mori, Toshiyuki Tanaka, Mori, Ryuhei +1 · 5 citations
Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1001.2662

openalex publication_date 2010/01/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A method of channel polarization, proposed by Arikan, allows us to construct efficient capacity-achieving channel codes. In the original work, binary input discrete memoryless channels are considered. A special case of q-ary channel polarization is considered by Sasoglu, Telatar, and Arikan. In this paper, we consider more general channel polarization on q-ary channels. We further show explicit constructions using Reed-Solomon codes, on which asymptotically fast channel polarization is induced.

Citations

• Polarization for arbitrary discrete memoryless channels

Cited by

• Code distances: a new family of invariants of linear codes
• Joint Write-Once-Memory and Error-Control Codes
• Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices
• Binary Polarization Kernels from Code Decompositions
• Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry Codes

Related

• Polar codes for q-ary channels, q=2^r
• Polarization for arbitrary discrete memoryless channels
• A note on some inequalities used in channel polarization and polar coding
• Channel Polarization under Channel Noise with Memory
• Polar Codes for q-Ary Channels, q=2^r