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. In this paper, we provide some general results on parity-check codes from disjunct matrices. We then examine properties such as rate, distance, girth, and density of the families of codes obtained from three specific constructions of disjunct matrices.

翻译：暂无翻译