TY - GEN
T1 - Minimum distance and other properties of quasi-dyadic parity check codes
AU - Martinez, Meraiah
AU - Kelley, Christine A.
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85136291257&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85136291257&partnerID=8YFLogxK
U2 - 10.1109/ISIT50566.2022.9834770
DO - 10.1109/ISIT50566.2022.9834770
M3 - Conference contribution
AN - SCOPUS:85136291257
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2118
EP - 2123
BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE International Symposium on Information Theory, ISIT 2022
Y2 - 26 June 2022 through 1 July 2022
ER -