Minimum distance and other properties of quasi-dyadic parity check codes
Meraiah Martinez, Christine A. Kelley · 2022 IEEE International Symposium on Information Theory (ISIT) · 2022
A quasi-dyadic (QD) parity check code is a code whose parity check matrix representation is block structured with dyadic matrices as blocks. Depending on the number of nonzero positions in the leading row of each block, these codes may be either low density or moderate density. Moreover, each block is reproducible, giving QD codes advantages similar to quasi-cyclic (QC) codes. In this paper we examine basic code properties of QD-LDPC and QD-MDPC codes. These codes have potential to be of use in standard error correction applications as well as code-based cryptography due to their smaller key size.