Papers
Topics
Authors
Recent
Search
2000 character limit reached

Graph codes and local systems

Published 15 Mar 2018 in math.CO | (1803.05643v1)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up