Optimal LRC codes for all lenghts n <= q

02/01/2018

∙

by   Oleg Kolosov, et al.

∙

0

∙

share

A family of distance-optimal LRC codes from certain subcodes of q-ary Reed-Solomon codes, proposed by I. Tamo and A. Barg in 2014, assumes that the code length n is a multiple of r+1. By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.