Near regular LDPC codes based on combinatorial designs

DOI10.1142/S1793830924500976MaRDI QIDQ6900729zbMATH OpenFDO

Authors Shyam Saurabh, Sheet Nihal Topno, Kishore Sinha

Publication date 12 November 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500976

zbMATH Keywords

\((v, b, r, k)\)-configurationcombinatorial designsdual designnear regular LDPC codepermutation circulant matrix

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05)

Cites work

• 2-(v,k,) designs of small order
• Counting short cycles of \((c,d)\)-regular bipartite graphs
• Existence of generalized Bhaskar Rao designs with block size 3
• scientific article; zbMATH DE number 4064996 (Why is no real title available?)
• scientific article; zbMATH DE number 3453625 (Why is no real title available?)
• scientific article; zbMATH DE number 917328 (Why is no real title available?)
• scientific article; zbMATH DE number 3352656 (Why is no real title available?)
• scientific article; zbMATH DE number 2242445 (Why is no real title available?)
• LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing
• Linked systems of symmetric group divisible designs
• Matrix approaches to constructions of group divisible designs
• On PBIBD designs based on triangular schemes
• Some matrix constructions of L₂-type Latin square designs

This page was built for publication: Near regular LDPC codes based on combinatorial designs

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