Graph codes and local systems
Combinatorics
2018-03-16 v1
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.
Cite
@article{arxiv.1803.05643,
title = {Graph codes and local systems},
author = {Roy Meshulam},
journal= {arXiv preprint arXiv:1803.05643},
year = {2018}
}
Comments
4 pages