Eigenvalues and expansion of bipartite graphs

DOI10.1007/s10623-011-9598-6zbMath1254.05103OpenAlexW2011032342MaRDI QIDQ690667

Heeralal Janwa, Tom Høholdt

Publication date: 28 November 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/83aaf771-5fc6-4797-b51d-df6f3b8b3255

zbMATH Keywords

isoperimetric constantbipartite graphsLDPC codeseigenvalues of graphsexpander graphsBIBD'sbipartite Ramanujan graphsgeneralized N-gons

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of design theory to circuits and networks (94C30) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals ⋮ Explicit non-malleable codes from bipartite graphs ⋮ On the sizes of expander graphs and minimum distances of graph codes ⋮ A spectral version of the Moore problem for bipartite regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite generalized quadrangles
• The dimensions of \(LU(3,q)\) codes
• Explicit construction of linear sized tolerant networks
• Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li)
• On Tanner codes: Minimum distance and decoding
• Explicit construction of graphs with an arbitrary large girth and of large size
• Some low-density parity-check codes derived from finite geometries
• Ramanujan graphs on cosets of \(\operatorname{PGL}_2(\mathbb F_q)\)
• Some elementary Ramanujan graphs
• Expander codes
• Linear-time encodable and decodable error-correcting codes
• Explicit Concentrators from Generalized N-Gons
• Expander graphs and their applications
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
• Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes
• Minimum-distance bounds by graph analysis
• On expander codes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Error exponents of expander codes
• Codes on graphs: Recent progress

This page was built for publication: Eigenvalues and expansion of bipartite graphs