Graph codes and local systems
classification
🧮 math.CO
keywords
codesgraphcertaincoefficientexpanderfirstgoodhomology
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.