Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
From MaRDI portal
Publication:5386098
DOI10.1007/978-3-540-77224-8_26zbMath1195.94085arXiv0810.0567OpenAlexW1525184823MaRDI QIDQ5386098
Safitha J. Raj, Andrew Thangaraj
Publication date: 17 April 2008
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.0567
Cites Work
- Unnamed Item
- Polynomial Codes Over Certain Finite Fields
- Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes
- Algebraic soft-decision decoding of reed-solomon codes
- Bit-level soft-decision decoding of Reed-Solomon codes
- Studying the locator polynomials of minimum weight codewords of BCH codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Generalized minimum distance decoding
This page was built for publication: Subcodes of Reed-Solomon Codes Suitable for Soft Decoding