Bounds on the Expansion Properties of Tanner Graphs

DOI10.1109/TIT.2007.909127zbMATH Open1325.05108OpenAlexW2167696711MaRDI QIDQ3549002FDOQ3549002

Authors: Mingrui Zhu, Keith M. Chugg 

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.2007.909127

Recommendations

• Eigenvalue bounds on the pseudocodeword weight of expander codes
• On Tanner codes: Minimum distance and decoding
• Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
• Improved Probabilistic Bounds on Stopping Redundancy
• Minimum-distance bounds by graph analysis

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)

Cited In (3)

• Dilatations of graphs and Taylor's formula: some results about convergence
• Reconstruction of a linear recurrence of maximal period over a Galois ring from its highest coordinate sequence
• A class of injective compressing maps on linear recurring sequences over a Galois ring

This page was built for publication: Bounds on the Expansion Properties of Tanner Graphs

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