A New Formula for the Minimum Distance of an Expander Code
Combinatorics
2021-01-06 v1 Information Theory
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 is a lower bound of the minimum distance of the expander code given by a expander bipartite graph.
Cite
@article{arxiv.2101.01339,
title = {A New Formula for the Minimum Distance of an Expander Code},
author = {Sudipta Mallik},
journal= {arXiv preprint arXiv:2101.01339},
year = {2021}
}