Analysis of Blind Reconstruction of BCH Codes

Entropy

Dong-Joon Shin¹  Soonhee Kwon¹ 

[1] Department of Electronics and Computer Engineering, Hanyang University, Seoul 04763, Korea;

关键词: blind reconstruction;    BCH codes;    galois field;    galois field fourier transform;    lower-bound;    RS codes;   

DOI  :  10.3390/e22111256

来源: DOAJ

【 摘 要 】

In this paper, the theoretical lower-bound on the success probability of blind reconstruction of Bose–Chaudhuri–Hocquenghem (BCH) codes is derived. In particular, the blind reconstruction method of BCH codes based on the consecutive roots of generator polynomials is mainly analyzed because this method shows the best blind reconstruction performance. In order to derive a performance lower-bound, the theoretical analysis of BCH codes on the aspects of blind reconstruction is performed. Furthermore, the analysis results can be applied not only to the binary BCH codes but also to the non-binary BCH codes including Reed–Solomon (RS) codes. By comparing the derived lower-bound with the simulation results, it is confirmed that the success probability of the blind reconstruction of BCH codes based on the consecutive roots of generator polynomials is well bounded by the proposed lower-bound.

【 授权许可】

Unknown