2000 character limit reached
A New Formula for the Minimum Distance of an Expander Code (2101.01339v1)
Published 5 Jan 2021 in math.CO, cs.IT, and math.IT
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-\varepsilon) \gamma n$ is a lower bound of the minimum distance of the expander code given by a $(m,n,d,\gamma,1-\varepsilon)$ expander bipartite graph.