Abstract
The problem of efficient soft-decision decoding of Reed-Solomon codes is considered. Low-complexity sequential algorithm was recently proposed for decoding of polar codes. A generalization of this algorithm to the case of Reed-Solomon codes, represented as polar codes with dynamic frozen symbols, is proposed. Simplification of the proposed decoding algorithm to the case of transmission of binary image of Reed-Solomon code is derived.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 2014 International Symposium on Information Theory and its Applications (ISITA2014) |
| Place of Publication | Japan |
| Pages | 453-457 |
| Publication status | Published - 11 Dec 2014 |
Fingerprint
Dive into the research topics of 'Sequential decoding of Reed-Solomon codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver