A Class of Binary Linear Codes With Optimal Stopping Redundancy

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.