Sudipta Mallik
Published 2021-01-05Version 1
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.
Characterisation of a family of neighbour transitive codes
Minimum distance of Line Orthogonal Grassmann Codes in even characteristic
Computing the minimum distance of the $C(\mathbb{O}_{3,6})$ polar Orthogonal Grassmann code with elementary methods
![QR code for arXiv:2101.01339 [math.CO]](http://oss.arxitics.com/images/favicon.svg)