1999•Electronics and Communications in Japan (Part III Fundamental Electronic Science)Requires access

On decoding methods beyond the BCH bound and their applications to soft-decision decoding

Manabu Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa

Open publisher page 0 citations

Abstract

For the two-dimensional BCH code, several decoding methods exceeding the BCH bound and correcting the errors that cannot be corrected by the conventional limited distance decoding method have been proposed. This article proposes an algorithm that allows reduction of the computational volume in a decoding method exceeding the BCH bound by solving the equation for unknown variables beforehand and limiting the range of the error location. Further, this decoding method exceeding the BCH bound is applied to soft-decision decoding methods that use limited-distance decoding multiple times, and especially to Chase decoding, the decoding of Tanaka et al., and that of Kaneko et al. It is shown that the amount of computation and the decoding error rate are improved. ©1999 Scripta Technica, Electron Comm Jpn Pt 3, 82(9): 39–51, 1999.

About this research paper

What this paper is about

For the two-dimensional BCH code, several decoding methods exceeding the BCH bound and correcting the errors that cannot be corrected by the conventional limited distance decoding method have been proposed. This article proposes an algorithm that allows reduction of the computational volume in a decoding method exceeding the BCH bound by solving the equation for unknown variables beforehand and limiting the range of the error location. Further, this decoding method exceeding the BCH bound is applied to soft-decision decoding methods that use limited-distance decoding multiple times, and especially to Chase decoding, the decoding of Tanaka et al., and that of Kaneko et al. It is shown that the amount of computation and the decoding error rate are improved. ©1999 Scripta Technica, Electron Comm Jpn Pt 3, 82(9): 39–51, 1999.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

For the two-dimensional BCH code, several decoding methods exceeding the BCH bound and correcting the errors that cannot be corrected by the conventional limited distance decoding method have been proposed. This article proposes an algorithm that allows reduction of the computational volume in a decoding method exceeding the BCH bound by solving the equation for unknown variables beforehand and limiting the range of the error location. Further, this decoding method exceeding the BCH bound is applied to soft-decision decoding methods that use limited-distance decoding multiple times, and especially to Chase decoding, the decoding of Tanaka et al., and that of Kaneko et al. It is shown that the amount of computation and the decoding error rate are improved. ©1999 Scripta Technica, Electron Comm Jpn Pt 3, 82(9): 39–51, 1999.

Key concepts: BCH code, Decoding methods, Berlekamp–Welch algorithm, List decoding, Sequential decoding, Algorithm, Mathematics, Reduction (mathematics)

Related papers

Back to paper searchBrowse research topicsOriginal source
On decoding methods beyond the BCH bound and their applications to soft-decision decoding — Research Paper | ScholarLens