A Sufficient Condition for a Generalized Minimum Distance Reed-Solomon Decoder to Ensure Correct Decoding

Norifumi KAMIYA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E80-A    No.11    pp.2066-2072
Publication Date: 1997/11/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Reed-Solomon codes,  BCH codes,  soft decision decoding,  generalized minimum distance decoding,  optimality,  

Full Text: PDF(435.2KB)>>
Buy this Article

Generalized minimum-distance (GMD) decoding is well-known as a soft decision decoding technique for such linear block codes as BCH and RS codes. The GMD decoding algorithm generates a set of candidate codewords and selects as a decoded codeword that candidate with the smallest reliable distance. In this paper, for a GMD decoder of RS and BCH codes, we present a new sufficient condition for the decoded codeword to be optimal, and we show that this sufficient condition is less stringent than the one presented by Taipale and Pursely.