A New Formula for the Minimum Distance of an Expander Code

01/05/2021
by   Sudipta Mallik, et al.
0

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 a (m,n,d,γ,1-ε) expander bipartite graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2023

On the Minimum Distance, Minimum Weight Codewords, and the Dimension of Projective Reed-Muller Codes

We give an alternative proof of the formula for the minimum distance of ...
research
02/04/2021

Decoding of (Interleaved) Generalized Goppa Codes

Generalized Goppa codes are defined by a code locator set ℒ of polynomia...
research
04/20/2019

Linear codes over signed graphs

We give formulas, in terms of graph theoretical invariants, for the mini...
research
12/13/2019

On Pre-transformed Polar Codes

In this paper, we prove that any pre-transformation with an upper-triang...
research
11/15/2021

Improved Decoding of Expander Codes

We study the classical expander codes, introduced by Sipser and Spielman...
research
09/15/2023

A note on the Assmus–Mattson theorem for some non-binary codes (a resume)

Let C be a two and three-weight ternary code. Furthermore, we assume tha...
research
08/31/2020

Construction of LDPC convolutional codes via difference triangle sets

In this paper, a construction of (n,k,δ) LDPC convolutional codes over a...

Please sign up or login with your details

Forgot password? Click here to reset