On the sizes of expander graphs and minimum distances of graph codes

DOI10.1016/j.disc.2014.02.005zbMath1288.05070OpenAlexW1976682682MaRDI QIDQ2449138

Jørn Justesen, Tom Høholdt

Publication date: 6 May 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.02.005

zbMATH Keywords

eigenvalueminimum distancegraph codes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

A spectral version of the Moore problem for bipartite regular graphs ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Eigenvalues and expansion of bipartite graphs
• On the second eigenvalue of a graph
• Interlacing eigenvalues and graphs
• Spectra of regular graphs and hypergraphs and orthogonal polynomials
• The nonexistence of certain generalized polygons
• Moore graphs and beyond: a survey of the degree/diameter problem
• The Minimum Distance of Graph Codes
• Expander codes
• A recursive approach to low complexity codes
• Error exponents of expander codes