Abstract
The problem of efficient soft-decision decoding of polar codes with any binary kernel is considered. The proposed approach represents a generalization of the sequential decoding algorithm introduced recently for the case of polar codes with Arikan kernel. Numeric results show that the proposed algorithm enables near-ML decoding of polar codes with BCH kernel.
| Original language | English |
|---|---|
| Title of host publication | 2014 IEEE Information Theory Workshop (ITW 2014) |
| Place of Publication | New York City, United States of America |
| Pages | 376-380 |
| DOIs | |
| Publication status | Published - 31 Dec 2014 |
Fingerprint
Dive into the research topics of 'Sequential decoding of polar codes with arbitrary binary kernel'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver