For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Sufficient Condition for a Generalized Minimum Distance Reed-Solomon Decoder to Ensure Correct Decoding
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/11/25
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>>
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.