Eigenvalues and expansion of bipartite graphs
DOI10.1007/S10623-011-9598-6zbMATH Open1254.05103OpenAlexW2011032342MaRDI QIDQ690667FDOQ690667
Authors: Tom Høholdt, Heeralal Janwa 
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
Recommendations
eigenvalues of graphsisoperimetric constantbipartite graphsexpander graphsLDPC codesBIBD'sbipartite Ramanujan graphsgeneralized N-gons
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of block designs (05B05) Eulerian and Hamiltonian graphs (05C45) Applications of design theory to circuits and networks (94C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Expander codes
- Title not available (Why is that?)
- Expander graphs and their applications
- Title not available (Why is that?)
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Error exponents of expander codes
- Finite generalized quadrangles
- Linear-time encodable and decodable error-correcting codes
- Explicit construction of linear sized tolerant networks
- Explicit Concentrators from Generalized N-Gons
- 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
- Explicit construction of graphs with an arbitrary large girth and of large size
- Title not available (Why is that?)
- On expander codes
- Title not available (Why is that?)
- Some low-density parity-check codes derived from finite geometries
- Some elementary Ramanujan graphs
- The dimensions of \(LU(3,q)\) codes
- 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
- Ramanujan graphs on cosets of \(\operatorname{PGL}_2(\mathbb F_q)\)
- Optimal bipartite Ramanujan graphs from balanced incomplete block designs: their characterizations and applications to expander/LDPC codes
- Minimum-distance bounds by graph analysis
- Codes on graphs: Recent progress
Cited In (15)
- Expansion in matrix-weighted graphs
- Bipartite density of cubic graphs: The case of equality
- Eigenvalues and expanders
- Title not available (Why is that?)
- Expanders obtained from affine transformations
- Spectral gap in random bipartite biregular graphs and applications
- Explicit non-malleable codes from bipartite graphs
- On the bipartiteness constant and expansion of Cayley graphs
- A spectral version of the Moore problem for bipartite regular graphs
- On the sizes of expander graphs and minimum distances of graph codes
- Title not available (Why is that?)
- Expansion properties of Levi graphs.
- Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues
- The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals
- Bicliques and eigenvalues
This page was built for publication: Eigenvalues and expansion of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690667)
