Work

A Class of Binary Linear Codes with Optimal Stopping Redundancy

Year: 2025

Type: article

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

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

DOI: 10.1587/transfun.2025eal2024

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: W4411198775

FWCI: 0.411

Cites: 10

Cited by: 1

Related to: 10