Optimal LRC codes for all lenghts n <= q
arXiv:1802.00157
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.