Abstract
A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which employs estimates of the not-yet-processed bit channel error probabilities to perform directed search in code tree, reducing thus the total number of iterations.
| Original language | English |
|---|---|
| Title of host publication | 2013 IEEE Information Theory Workshop (ITW) |
| Place of Publication | New York, United States of America |
| Pages | 1-5 |
| DOIs | |
| Publication status | Published - 23 Dec 2013 |
Fingerprint
Dive into the research topics of 'Polar codes with dynamic frozen symbols and their decoding by directed search'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver