2000 character limit reached
Graph codes and local systems (1803.05643v1)
Published 15 Mar 2018 in math.CO
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.