6 research outputs found
On Coset Leader Graphs of LDPC Codes
Our main technical result is that, in the coset leader graph of a linear
binary code of block length n, the metric balls spanned by constant-weight
vectors grow exponentially slower than those in .
Following the approach of Friedman and Tillich (2006), we use this fact to
improve on the first linear programming bound on the rate of LDPC codes, as the
function of their minimal distance. This improvement, combined with the
techniques of Ben-Haim and Lytsin (2006), improves the rate vs distance bounds
for LDPC codes in a significant sub-range of relative distances
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
Locally recoverable (LRC) codes have recently been a focus point of research
in coding theory due to their theoretical appeal and applications in
distributed storage systems. In an LRC code, any erased symbol of a codeword
can be recovered by accessing only a small number of other symbols. For LRC
codes over a small alphabet (such as binary), the optimal rate-distance
trade-off is unknown. We present several new combinatorial bounds on LRC codes
including the locality-aware sphere packing and Plotkin bounds. We also develop
an approach to linear programming (LP) bounds on LRC codes. The resulting LP
bound gives better estimates in examples than the other upper bounds known in
the literature. Further, we provide the tightest known upper bound on the rate
of linear LRC codes with a given relative distance, an improvement over the
previous best known bounds.Comment: To appear in IEEE Transactions on Information Theor