Graph codes and local systems
Abstract
It is shown that the good expander codes introduced by Sipser and Spielman, can be realized as the first homology of a graph with respect to a certain twisted coefficient system.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.