Connectivity graph-codes

DOI10.1002/RSA.21222MaRDI QIDQ6623574

Noga Alon

Publication date: 24 October 2024

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

zbMATH Keywords

connectivityerror correcting codesexpandersgraph codes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• On connectivity of the cartesian product of two graphs
• The theory of regular graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• The probabilistic method
• Edge-Disjoint Spanning Trees of Finite Graphs
• A parallel algorithmic version of the local lemma
• Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes
• Structured Codes of Graphs
• Graph-codes

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)