Presentation 1997/7/18
On Decoding Method Beyond the BCH Bound
Manabu KOBAYASHI, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) R.E.Blahut has proposed a method for decoding beyond the BCH bound by using the Berlekamp-Massey algorithm. This decoding algorithm is able to correct errors that cannot be obtained by the conventional bounded distance decoding. In this paper we show the complexity of decoding method proposed by Blahut can be reduced by solving equations of unknown discrepancy. Furthermore, we introduce this method to soft-decision decoding using algebraic decoder and show that both the complexity and the probability of decoding error of soft-decision decoding are reduced.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Berlekamp-Massey algorithm / Decoding beyond the BCH bound / Chase algorithm / MLD
Paper # IT97-20
Date of Issue

Conference Information
Committee IT
Conference Date 1997/7/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Decoding Method Beyond the BCH Bound
Sub Title (in English)
Keyword(1) Berlekamp-Massey algorithm
Keyword(2) Decoding beyond the BCH bound
Keyword(3) Chase algorithm
Keyword(4) MLD
1st Author's Name Manabu KOBAYASHI
1st Author's Affiliation School of Science and Engineering, Waseda University()
2nd Author's Name Toshiyasu MATSUSHIMA
2nd Author's Affiliation School of Science and Engineering, Waseda University
3rd Author's Name Shigeichi HIRASAWA
3rd Author's Affiliation School of Science and Engineering, Waseda University
Date 1997/7/18
Paper # IT97-20
Volume (vol) vol.97
Number (no) 180
Page pp.pp.-
#Pages 6
Date of Issue