Optimal LRC codes for all lenghts n <= q
Information Theory
2018-02-02 v1 math.IT
Abstract
A family of distance-optimal LRC codes from certain subcodes of -ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length is a multiple of By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.
Cite
@article{arxiv.1802.00157,
title = {Optimal LRC codes for all lenghts n <= q},
author = {Oleg Kolosov and Alexander Barg and Itzhak Tamo and Gala Yadgar},
journal= {arXiv preprint arXiv:1802.00157},
year = {2018}
}