Blind Reconstruction of BCH and RS Codes Using Single-Error Correction

Song, Minki; Kim, Jiho; Shin, Dong-Joon

doi:10.1109/tsp.2021.3110087

Cited by 16 publications

(16 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The vector h b can be denoted as the linear combination of the [1,5,6,7,8,11] -th rows of H. It means h b is in the space spanned by H and the assumed primitive polynomial is correct.…”

Section: Resultsmentioning

confidence: 99%

“…The size of symbol matrix in Swaminathan's method [14] is 3L × L and L ranges according to the assumed codeword length. The number of bits used in Song and Sharma's methods [5,7] is 10 5 . The simulation is executed for 100 times under each SNR, and the correct identification rates of the state of the art and our method are shown in Figures 1, 2 and 3.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A fast method for blindly identifying Reed‐Solomon codes based on matrix analysis

Han

Gao

et al. 2022

IET Communications

View full text Add to dashboard Cite

For the identification of Reed‐Solomon (RS) codes, the existing methods need to test the possible codeword length and the primitive polynomials exhaustively. Exhaustive search leads to high computational complexity. To overcome this limitation and fulfill the requirement in practice, a fast blind identification method is proposed. Different with most methods, our identification method is discussed in Galois Field of 2. First, by using Gaussian elimination, the bit matrix is transformed to the simplest upper triangular form. If the assumed codeword length is right, the matrix is of deficient rank, and the parameters of an RS code can be estimated according to the rank. The null space of the matrix, defined as the equivalent binary parity check matrix, can also be obtained from the simplification result. Then, a candidate set of primitive polynomials is constructed according to the estimated codeword length. By using the matrix null space, the correctness of a candidate primitive polynomial is tested through matrix analysis. Finally, by combining the estimated parameters, the generator polynomial of an RS code is identified. To decrease the bit errors in the matrix, soft‐decision data is used to select reliable bits. Experimental results show the effectiveness and robustness of our method.

show abstract

“…The vector h b can be denoted as the linear combination of the [1,5,6,7,8,11] -th rows of H. It means h b is in the space spanned by H and the assumed primitive polynomial is correct.…”

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

A fast method for blindly identifying Reed‐Solomon codes based on matrix analysis

Han

Gao

et al. 2022

IET Communications

View full text Add to dashboard Cite

show abstract

“…Here, it is assumed that the optional order of feedback polynomial is from 2 to 100. Therefore, the complexity of the algorithm for estimating the order of feedback polynomial is O(1∕(2𝜁) 4 ). After estimating the order of the feedback polynomial of the synchronous scrambler and then estimating the feedback polynomial at the corresponding order by the method in ref.…”

Section: Computational Complexity Analysismentioning

confidence: 99%

“…After estimating the order of the feedback polynomial of the synchronous scrambler and then estimating the feedback polynomial at the corresponding order by the method in ref. [11], the computational complexity of all is O(N L ∕(2𝜁 − 4𝜁 p) 2d ) + O(1∕(2𝜁) 4 ), where N L denotes the number of primitive polynomials of order L, p denotes the error probability of the binary symmetric channel (BSC), and d denotes the number of terms in the test polynomial. If only the method in ref.…”

Section: Computational Complexity Analysismentioning

confidence: 99%

“…This is because the communication protocol has many optional parameters and the intercepted signals may contain errors. In recent years, research has been published on methods for reconstructing channel coding parameters under non-cooperative conditions, including convolutional codes [1,2], cyclic codes [3,4], turbo codes [5,6], and LDPC codes [7,8]. Here, we study another important component of channel coding, namely linear scramblers.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast reconstruction of feedback polynomials for synchronous scramblers in a noisy environment

2022

View full text Add to dashboard Cite

As one of the key technologies of modern communication, a linear scrambler is a technique to randomize the data to be transmitted at the bit layer to improve the timing recovery and confidentiality of the transmitted data. Therefore, the reconstruction of scramblers under non-cooperative communication conditions has attracted extensive research interest. Existing efficient reconstruction methods are implemented by traversing the primitive polynomial of all orders, leading to extremely high computational complexity. Here, a fast reconstruction method for feedback polynomials of synchronous scramblers is proposed. The order of the feedback polynomial is first estimated by a hypothesis testing method, and then the primitive polynomial of the corresponding order is traversed to reduce the traversal range of the primitive polynomial, which greatly reduces the computational complexity of the reconstruction method. The simulation results verify the performance of the scheme.

show abstract

Blind recognition of channel codes based on a multiscale dilated convolution neural network

Liu,

Cao,

2024

Physical Communication

View full text Add to dashboard Cite

Blind Reconstruction of BCH and RS Codes Using Single-Error Correction

Cited by 16 publications

References 24 publications

A fast method for blindly identifying Reed‐Solomon codes based on matrix analysis

A fast method for blindly identifying Reed‐Solomon codes based on matrix analysis

Fast reconstruction of feedback polynomials for synchronous scramblers in a noisy environment

Blind recognition of channel codes based on a multiscale dilated convolution neural network

Contact Info

Product

Resources

About