A New Formula for the Minimum Distance of an Expander Code

DOI10.13069/JACODESMATH.1111379MaRDI QIDQ6357586arXivFDO

Authors Sudipta Mallik

Publication date 4 January 2021

Published in arXiv

Full work available at URL https://doi.org/10.13069/JACODESMATH.1111379

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

arXiv classification

cs.ITmath.COmath.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)gamman$ is a lower bound of the minimum distance of the expander code given by a $(m,n,d,gamma,1-varepsilon)$ expander bipartite graph.

This page was built for publication: A New Formula for the Minimum Distance of an Expander Code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357586)