A Sufficient Condition for a Generalized Minimum Distance Reed-Solomon Decoder to Ensure Correct Decoding
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.11 pp.2066-2072
- Publication Date
- 1997/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Norifumi KAMIYA, "A Sufficient Condition for a Generalized Minimum Distance Reed-Solomon Decoder to Ensure Correct Decoding" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 11, pp. 2066-2072, November 1997, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_11_2066/_p
Copy
@ARTICLE{e80-a_11_2066,
author={Norifumi KAMIYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Sufficient Condition for a Generalized Minimum Distance Reed-Solomon Decoder to Ensure Correct Decoding},
year={1997},
volume={E80-A},
number={11},
pages={2066-2072},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - A Sufficient Condition for a Generalized Minimum Distance Reed-Solomon Decoder to Ensure Correct Decoding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2066
EP - 2072
AU - Norifumi KAMIYA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1997
AB - 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.
ER -
English
