Connectivity graph-codes

DOI10.1002/RSA.21222MaRDI QIDQ6623574zbMATH OpenFDO

Authors Noga Alon

Publication date 24 October 2024

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21222

zbMATH Keywords

connectivityerror correcting codesexpandersgraph codes

Mathematics Subject Classification ID

Expander graphs (05C48) Graph operations (line graphs, products, etc.) (05C76) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Graph-codes
• Structured Codes of Graphs
• Phase transitions of structured codes of graphs
• A characterization of graphs by codes from their incidence matrices
• On the sizes of expander graphs and minimum distances of graph codes

Cites work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• A parallel algorithmic version of the local lemma
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graph theory with applications
• Graph-codes
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Interlacing families. IV: Bipartite Ramanujan graphs of all sizes
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On connectivity of the cartesian product of two graphs
• Structured Codes of Graphs
• The probabilistic method
• The theory of regular graphs

Cited in

(3)

• Graph-codes
• Phase transitions of structured codes of graphs
• Difference-isomorphic graph families

This page was built for publication: Connectivity graph-codes

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