A Class of Binary Linear Codes With Optimal Stopping Redundancy

Yingnan QI; Chuhong TANG; Haiyang LIU; Lianrong MA

doi:10.1587/transfun.2025EAL2024

Yingnan QI, Chuhong TANG, Haiyang LIU, Lianrong MA

著者情報

キーワード: Arithmetic progression, minimum distance, stopping distance, stopping redundancy

ジャーナルフリー早期公開

論文ID: 2025EAL2024

DOI https://doi.org/10.1587/transfun.2025EAL2024

詳細

抄録

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.

責任著者(Corresponding author)

J-STAGEへの登録はこちら（無料）