Binary Cycle Codes Have Optimal Stopping Redundancy

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.