Binary Cycle Codes Have Optimal Stopping Redundancy
In this letter, we prove that binary cycle codes constructed from simple connected graphs have optimal stopping redundancy. For such a code, we also obtain a full-rank parity-check matrix whose number of minimum-size stopping sets is equal to the number of minimum-weight codewords of the code.
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
- 2024-11-11
- DOI
- https://doi.org/10.1587/transfun.2024eal2062
- Citations
- 1
- Primary Topic
- Error Correcting Code Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.35
Funders
- National Natural Science Foundation of China