Work

Binary Cycle Codes Have Optimal Stopping Redundancy

Year: 2024

Type: article

Abstract: 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.

Source: IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

DOI: 10.1587/transfun.2024eal2062

Authors: Yingnan QI, Chuhong TANG, Haiyang LIU, Lianrong MA

Institutions: Chinese Academy of Sciences, Institute of Microelectronics, University of Chinese Academy of Sciences, Tsinghua University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: National Natural Science Foundation of China

OpenAlex ID: W4404232277

FWCI: 0.148

Cites: 14

Cited by: 1

Related to: 10