Open-set blind recognition of non-binary LDPC codes

Blind encoder recognition methods have drawn much research interest in recent years, as they can play an important role in non-cooperative scenarios. This paper proposes an open-set blind recognition method for non-binary Low-Density Parity-Check (LDPC) codes with high performance. We derive the principle of obtaining a non-binary Parity-Check Matrix (PCM) from the received signal and further apply the Gauss-Jordan Column Elimination (GJCE) over G F ( q ) . An iterative process involving GJCE, LDPC decoding, and PCM sparsification is applied in our proposed method. The proposed symbol-level blind recognition is shown to perform much better than the bit-level one. Experimental results demonstrate that our proposed method can completely reconstruct the PCMs at a bit error rate of 0.4% for the moderate-length non-binary LDPC codes.

Authors

Institutions

Publication Details

Journal
Digital Communications and Networks
Published
2025-10-01
DOI
https://doi.org/10.1016/j.dcan.2025.10.004
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Open-set blind recognition of non-binary LDPC codes

Junhui Zhao, Shiqiu Liu, Ming Jiang, Dongrui Huan
Digital Communications and Networks
Error Correcting Code Techniques
article

Open-set blind recognition of non-binary LDPC codes

Junhui Zhao, Shiqiu Liu, Ming Jiang, Dongrui Huan
article en

Abstract

Blind encoder recognition methods have drawn much research interest in recent years, as they can play an important role in non-cooperative scenarios. This paper proposes an open-set blind recognition method for non-binary Low-Density Parity-Check (LDPC) codes with high performance. We derive the principle of obtaining a non-binary Parity-Check Matrix (PCM) from the received signal and further apply the Gauss-Jordan Column Elimination (GJCE) over G F ( q ) . An iterative process involving GJCE, LDPC decoding, and PCM sparsification is applied in our proposed method. The proposed symbol-level blind recognition is shown to perform much better than the bit-level one. Experimental results demonstrate that our proposed method can completely reconstruct the PCMs at a bit error rate of 0.4% for the moderate-length non-binary LDPC codes.

Digital Communications and Networks
Beijing Jiaotong University (CN), Peng Cheng Laboratory (CN), Purple Mountain Laboratories (CN), Southeast University (CN)
Openalex Percentile: Top 63%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.