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 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)
