Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
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. In this work, we consider certain subcodes of RS codes over GF(q m ) 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.
KeywordsLinear Code Block Error List Decoder Weight Codeword Soft Decoder
Unable to display preview. Download preview PDF.