A New Formula for the Minimum Distance of an Expander Code
Abstract
An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of such codes. We also provide a new proof of the result that 2(1-) γ n is a lower bound of the minimum distance of the expander code given by a (m,n,d,γ,1-) expander bipartite graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.