Subcodes of Reed-Solomon Codes Suitable for Soft Decoding

DOI10.1007/978-3-540-77224-8_26MaRDI QIDQ5386098zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Abstract: Reed-Solomon (RS) codes over GF$(2^m)$ have traditionally been the most popular non-binary codes in almost all practical applications. The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. However, efficient and implementable soft decoding for high-rate (about 0.9) RS codes over large fields (GF(256), say) continues to remain a subject of research with a promise of further coding gains. In this work, our objective is to propose and investigate $2^m$-ary codes with non-trivial binary trace codes as an alternative to RS codes. We derive bounds on the rate of a $2^m$-ary code with a non-trivial binary trace code. Then we construct certain subcodes of RS codes over GF($2^m$) that have a non-trivial binary trace with distances and rates meeting the derived bounds. The properties of these subcodes are studied and low-complexity hard-decision and soft-decision decoders are proposed. The decoders are analyzed, and their performance is compared with that of comparable RS codes. Our results suggest that these subcodes of RS codes could be viable alternatives for RS codes in applications.

Recommendations

• Subspace subcodes of generalized Reed-Solomon codes
• An efficient soft-decision Reed-Solomon decoding algorithm
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Sequential decoding for a subcode of Reed Solomon codes
• Bit-level soft-decision decoding of Reed-Solomon codes

Cites work

• Algebraic soft-decision decoding of reed-solomon codes
• Bit-level soft-decision decoding of Reed-Solomon codes
• Generalized minimum distance decoding
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Polynomial Codes Over Certain Finite Fields
• Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes
• Studying the locator polynomials of minimum weight codewords of BCH codes

Cited in

(7)

• Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Critically Subsampled Filterbanks for SISO Reed–Solomon Decoding
• Sequential decoding for a subcode of Reed Solomon codes
• An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)
• Subgroup subcodes
• Subspace subcodes of generalized Reed-Solomon codes

This page was built for publication: Subcodes of Reed-Solomon Codes Suitable for Soft Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386098)