Codes based on dyadic matrices and their generalizations

DOI10.3934/AMC.2024054MaRDI QIDQ6981201zbMATH OpenFDO

Authors Meraiah Martinez, Tefjol Pllaha, Christine A. Kelley

Publication date 21 May 2025

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2024054

zbMATH Keywords

dyadic codesgirthLDPC codesquantum codesTanner graph

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites work

• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• A transform theory for a class of group-invariant codes
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• Compact McEliece keys from Goppa codes
• Designing efficient dyadic operations for cryptographic applications
• Good quantum error-correcting codes exist
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• LDPC code designs, constructions, and unification
• Modern Coding Theory
• Monoidic codes in cryptography
• Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
• Reproducible families of codes and cryptographic applications
• Simple quantum error-correcting codes
• Which codes have cycle-free Tanner graphs?

This page was built for publication: Codes based on dyadic matrices and their generalizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981201)