On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth

DOI10.1109/TIT.2020.3017127zbMath1452.05093OpenAlexW3053432656MaRDI QIDQ5138789

Ali Dehghan, Amir H. Banihashemi

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2020.3017127

zbMATH Keywords

polynomial time algorithmbipartite (Tanner) graphsconstruction of good low-density parity-check (LDPC) codes

Mathematics Subject Classification ID

Hypergraphs (05C65) Linear codes (general theory) (94B05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth