Locally Repairable Codes from Cyclic Codes and Generalized Quadrangles

Locally repairable codes (LRCs) with locality r and availability t are a class of codes which can recover data from erasures by accessing other t disjoint repair groups, that every group contain at most r other code symbols. This letter will investigate constructions of LRCs derived from cyclic codes and generalized quadrangle. On the one hand, two classes of cyclic LRC with given locality m - 1 and availability em are proposed via trace function. Our LRCs have the same locality, availability, minimum distance and code rate, but have short length and low dimension. On the other hand, an LRC with (2; ( p + 1)(sic)s/2(sic)) is presented based on sets of points in PG(k; q) which form generalized quadrangles with order ( s; p). For k = 3; 4; 5, LRCs with r = 2 and di fferent t are determined.