Blind Reconstruction of Binary Primitive BCH Code Based on Error Codeword Correction

Authors:
Publisher website
Google Scholar
Abstract
In this paper, a blind reconstruction method of binary primitive BCH code is proposed, which can identify the generator polynomial of BCH code from received noisy bitstreams. Firstly, error codewords are exposed according to the fact that correct codeword polynomials shall have consecutive roots. Secondly, the recovery of error codewords will be fast completed by leveraging the parity-check matrix of BCH code. Then, the consecutive roots of BCH code are determined by measuring the discrepancy between their experimental occurring probability and their theoretical occurring probability. Finally, the generator polynomial of BCH code are reconstructed based on the detected roots. Simulation results show that for the BCH codes whose error correction capability exceed 2 bits, the proposed method outperforms the reconstruction method using single-error correction.
Funding Information
  • NSFC (62071394)