Parity-check codes from disjunct matrices

DOI10.3934/AMC.2024034MaRDI QIDQ7025884zbMATH OpenFDO

Authors Kathryn Haymaker, Emily McMillon

Publication date 19 February 2025

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

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

zbMATH Keywords

coding theorydisjunct matricesLDPC codesMDPC codesparity-check codesseparable matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Special matrices (15B99) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Cites work

• A novel use of t-packings to construct d-disjunct matrices
• A recursive approach to low complexity codes
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• Absorbing sets of codes from finite geometries
• Extremal absorbing sets in low-density parity-check codes
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Fundamentals of Error-Correcting Codes
• Group Testing Schemes From Codes and Designs
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Nonadaptive Group Testing With Random Set of Defectives
• Nonrandom binary superimposed codes
• On almost disjunct matrices for group testing
• On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.

This page was built for publication: Parity-check codes from disjunct matrices

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