vix.ing · top · new · best · stats · spec

Performance of Polar Codes for Channel and Source Coding

2009/01/16 by Nadine Hussami, Hussami, Nadine, Satish Babu Korada +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Advanced Wireless Communication Techniques #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.0901.2370

openalex publication_date 2009/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Polar codes, introduced recently by Arıkan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in this respect, their finite-length performance is not record breaking. We discuss several techniques through which their finite-length performance can be improved. We also study the performance of these codes in the context of source coding, both lossless and lossy, in the single-user context as well as for distributed applications.

Citations

Related