A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

• Qian Liu,
• Hao Zhang,
• Peidong Yu,
• Gang Wang,
• Zhaoyang Qiu,

Vol. 15, No. 9, September 30, 2021
10.3837/tiis.2021.09.020, Download Paper (Free):

• Two-step screening algorithm
• blind identification
• linear block code
• linear error equation
• matrix partition
• Galois field
• Gauss elimination process

Abstract

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel “two-step-screening” algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel “two-step-screening” algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

Statistics

Cite this article