Classification and Generator Polynomial Estimation Method for BCH Codes 


Vol. 38,  No. 2, pp. 156-163, Feb.  2013


PDF
  Abstract

The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Lee, C. Park, J. Lee, Y. Song, "Classification and Generator Polynomial Estimation Method for BCH Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 2, pp. 156-163, 2013. DOI: .

[ACM Style]

Hyun Lee, Cheol-sun Park, Jae-hwan Lee, and Young-joon Song. 2013. Classification and Generator Polynomial Estimation Method for BCH Codes. The Journal of Korean Institute of Communications and Information Sciences, 38, 2, (2013), 156-163. DOI: .

[KICS Style]

Hyun Lee, Cheol-sun Park, Jae-hwan Lee, Young-joon Song, "Classification and Generator Polynomial Estimation Method for BCH Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 2, pp. 156-163, 2. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880