2023/11/28 by Haymaker, Kathryn, McMillon, Emily
#05B20 (Secondary) #15B99 #94B05 (Primary) 94B25 #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2311.17262
The matrix representations of linear codes have been well-studied for use as disjunct matrices. However, no connection has previously been made between the properties of disjunct matrices and the parity-check codes obtained from them. This paper makes this connection for the first time. We provide some fundamental results on parity-check codes from general disjunct matrices (in particular, a minimum distance bound). We then consider three specific constructions of disjunct matrices and provide parameters of their corresponding parity-check codes including rate, distance, girth, and density. We show that, by choosing the correct parameters, the codes we construct have the best possible error-correction performance after one round of bit-flipping decoding with regard to a modified version of Gallager's bit-flipping decoding algorithm.