Subcodes of Reed-Solomon codes suitable for soft decoding

Authors:
Safitha J. Raj;Andrew Thangaraj
Affiliations:
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India;Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India
Venue:
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Year:
2007

Citing 3
Cited 0

Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes

IEEE Transactions on Information Theory
Simple MAP decoding of first-order Reed-Muller and Hamming codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reed-Solomon (RS) codes over GF(2m) 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. In this work, we consider certain subcodes of RS codes over GF(qm) whose q-ary traces are BCH codes over GF(q). 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 have some advantages when compared to RS codes.