Name
Abstract | ||
|---|---|---|
Most versions of the Peterson-Gorenstein-Zierler (PGZ) decoding algorithm are not true bounded distance decoding algorithms in the sense that when a received vector is not in the decoding sphere of any codeword, the algorithm does not always declare a decoding failure. For a t-error-correcting BCH code, if the received vector is at distance i, i⩽t from a codeword in a supercode with BCH distance t+i+1, the decoder will output that codeword from the supercede. If that codeword is not a member of the t-error-correcting code, then decoder malfunction is said to have occurred. We describe the necessary and sufficient conditions for decoder malfunction, and show that malfunction can be avoided in the PGZ decoder by checking t-ν equations, where ν is the number of errors hypothesized by the decoder. A formula for the probability of decoder malfunction is also given, and the significance of decoder malfunction is considered for PGZ decoders and high-speed Berlekamp-Massey decoders |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/18.333881 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
BCH codes,decoding,error correction codes,probability,BCH code,BCH distance,Berlekamp-Massey decoders,Peterson-Gorenstein-Zierler decoder,codeword,decoder malfunction probability,decoding algorithm,decoding failure,error correction code,necessary conditions,received vector,sufficient conditions | Discrete mathematics,Computer science,Arithmetic,Reed–Solomon error correction,Error detection and correction,BCH code,Viterbi decoder,Code word,Soft-decision decoder,Decoding methods,Bounded function | Journal |
Volume | Issue | ISSN |
40 | 5 | 0018-9448 |
Citations | PageRank | References |
1 | 0.39 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Srinivasan | 1 | 1 | 0.39 |
| D. V. Sarwate | 2 | 431 | 121.44 |