A New Formula for the Minimum Distance of an Expander Code
Document Type
Article
Publication Date
5-2025
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 an (m,n,d,γ, 1−ε)expander bipartite graph.
Recommended Citation
Mallik, S. (2022). A new formula for the minimum distance of an expander code. Journal of Algebra Combinatorics Discrete Structures and Applications, 9(2), 9-14. https://doi.org/10.13069/jacodesmath.1111379
Comments
Copyright © 2022. Journal of Algebra Combinatorics Discrete Structures and Applications. All rights reserved.