Blind recognition of parameters of linear block codes from intercepted bit stream

Sharma, Anand; Pillai, N. Rajesh

doi:10.1109/ccaa.2016.7813910

Cited by 8 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was reported that the acceptable BER would be 1% in the worst case [10 ]. Thus, the PCR of the proposed method is more than sufficient because the acceptable BER was set to 10% for it.…”

Section: Simulation Resultsmentioning

confidence: 99%

Blind recognition of binary BCH codes based on Euclidean algorithm

Zheng

et al. 2020

Electron. lett.

View full text Add to dashboard Cite

A novel method based on Euclidean algorithm is proposed to solve the problem of blind recognition of binary Bose–Chaudhuri–Hocquenghem (BCH) codes in non‐cooperative applications. By carrying out iterative Euclidean divisions on the demodulator output bit‐stream, the proposed method can determine the codeword length and generator polynomial of unknown BCH code. The computational complexity is derived as O (n 3 ). Simulation results show the efficiency of the proposed method.

show abstract

“…It was reported that the acceptable BER would be 1% in the worst case [10 ]. Thus, the PCR of the proposed method is more than sufficient because the acceptable BER was set to 10% for it.…”

Section: Simulation Resultsmentioning

confidence: 99%

Blind recognition of binary BCH codes based on Euclidean algorithm

Zheng

et al. 2020

Electron. lett.

View full text Add to dashboard Cite

show abstract

“…Cluzeau 10 and Chabot 11 reconstructed parity check matrix of the code but restriction was that weight of the dual should be very low. Ref 12 explored probabilistic approach for separating message bits from parity bits and extracting codeword size and message size from intercepted noisy bitstream provided input message bits has biased probability. These techniques are useful for binary linear block code of smaller codeword size and can not be used for Reed-Solomon code.…”

Section: Introductionmentioning

confidence: 99%

Blind Recognition of Parameters of Reed Solomon Code from Intercepted Erroneous Codewords

Sharma

Gupta

2021

Def. Sc. J.

Self Cite

View full text Add to dashboard Cite

Error correcting codes are designed for reliable transmission of digital information over a noisy channel. Several papers have been published on blind identification of binary FEC codes but papers reported on the identification of non-binary error correcting codes are less. Due to its strong error correction capability, RS (Reed-Solomon) code is being used widely. So technique for blind recognition of RS code is required to analyse intercepted signal as well as for intelligent communication. This paper presents a technique for extraction of parameters of Reed-Solomon code from intercepted demodulated bitstream. The proposed algorithm is very simple and hence it is very practical for hardware implementation. Our approach has been verified using MATLAB simulation.

show abstract

Performance Bound Analysis on Hamming-Weight-Analysis Algorithm for Blind Recognition of Linear Block Codes

Mao

2018

Communications and Networking

View full text Add to dashboard Cite

Blind recognition of parameters of linear block codes from intercepted bit stream

Cited by 8 publications

References 7 publications

Blind recognition of binary BCH codes based on Euclidean algorithm

Blind recognition of binary BCH codes based on Euclidean algorithm

Blind Recognition of Parameters of Reed Solomon Code from Intercepted Erroneous Codewords

Performance Bound Analysis on Hamming-Weight-Analysis Algorithm for Blind Recognition of Linear Block Codes

Contact Info

Product

Resources

About