Graph codes and local systems

arXiv1803.05643MaRDI QIDQ6299093FDOQ6299093

Authors: Roy Meshulam 

Publication date: 15 March 2018

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.

Mathematics Subject Classification ID

Simplicial sets and complexes in algebraic topology (55U10) Linear codes (general theory) (94B05)

This page was built for publication: Graph codes and local systems

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