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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人電子情報通信学会の論文
• 1997-11-25

著者

• Kamiya N

  Nec Corp. Kawasaki‐shi Jpn

• KAMIYA Norifumi

  C&C Research Laboratories, NEC Corp.

関連論文

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

スポンサーリンク