Blind Reconstruction of BCH Codes Based on Consecutive Roots of Generator Polynomials
Daemin Jo, Soonhee Kwon, Dong‐Joon Shin
Abstract
Daemin Jo, Soonhee Kwon, Dong‐Joon Shin
Abstract
In this letter, a blind reconstruction method of Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed, which uses the property that all the codeword polynomials of a t-error correcting BCH code have the same 2t consecutive roots over Galois field. The proposed method inherently eliminates most of the erroneous codewords from the received codewords by utilizing the information about the starting position and length of consecutive roots of each received codeword. Therefore, the blind reconstruction performance is substantially improved and the simulation results confirm that the proposed method outperforms other blind reconstruction methods.
OpenAlex reports 47 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this letter, a blind reconstruction method of Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed, which uses the property that all the codeword polynomials of a t-error correcting BCH code have the same 2t consecutive roots over Galois field. The proposed method inherently eliminates most of the erroneous codewords from the received codewords by utilizing the information about the starting position and length of consecutive roots of each received codeword. Therefore, the blind reconstruction performance is substantially improved and the simulation results confirm that the proposed method outperforms other blind reconstruction methods.
Key concepts: BCH code, Code word, Galois theory, Finite field, Code (set theory), Polynomial code, Mathematics, Algorithm