Algebraic construction of sparse matrices with large girth

DOI10.1109/TIT.2005.862120MaRDI QIDQ3547447zbMATH OpenOpenAlexFDO

Authors Michael E. O'Sullivan

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Basic linear algebra (15A99) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 1300134
• scientific article; zbMATH DE number 1253983
• scientific article; zbMATH DE number 1287852
• scientific article; zbMATH DE number 1441842
• scientific article; zbMATH DE number 4100479
• A simple construction for the sparse matrices with orthogonal rows
• scientific article; zbMATH DE number 51442
• Sparse matrices
• scientific article; zbMATH DE number 3901910
• scientific article; zbMATH DE number 3997028

Cited in

(11)

• Some combinatorial aspects of constructing bipartite-graph codes
• QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
• On the search of smallest QC-LDPC code with girth six and eight
• An explicit method to generate some QC LDPC codes with girth 8
• Shortened Array Codes of Large Girth
• Low density parity check codes based on sparse matrices with no small cycles
• Generating random graphs with large girth
• A reduction in the search space of QC-LDPC codes with girth 8
• An efficient algorithm for counting cycles in QC and APM LDPC codes
• Type-II APM-LDPC codes with girth 6
• Girth tenacity of some cube-like networks

This page was built for publication: Algebraic construction of sparse matrices with large girth

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