A Class of Binary Linear Codes with Optimal Stopping Redundancy
In this letter, we construct a class of binary parity-check matrices with column weight 3 and show that these matrices have full-rank. Then we prove that the stopping distance of each binary parity-check matrix is equal to the minimum distance of the code specified by the parity-check matrix. Taken together, we obtain a new class of binary linear codes with optimal stopping redundancy.
Authors
- Lianrong Ma
- Haiyang Liu (ORCID: https://orcid.org/0000-0003-0397-5770)
- C. J. Tang
- Y Qi
Institutions
- Chinese Academy of Sciences (CN)
- University of Chinese Academy of Sciences (CN)
- Tsinghua University (CN)
Publication Details
- Journal
- IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
- Published
- 2025-06-11
- DOI
- https://doi.org/10.1587/transfun.2025eal2024
- Primary Topic
- Error Correcting Code Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China