A new formula for the minimum distance of an expander code

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Sudipta Mallik¹ 

[1] Department of Mathematics and Statistics, Northern Arizona University

关键词: Expander code;    Expander graph;    Minimum distance;   

DOI  :  10.13069/jacodesmath.1111379

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

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 an $(m,n,d,\gamma,1-\varepsilon)$ expander bipartite graph.

【 授权许可】

CC BY