A New Formula for the Minimum Distance of an Expander Code
share
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.
READ FULL TEXT