Paper Info
Title
Locally Repairable Codes From Cyclic Codes And Generalized Quadrangles
Abstract
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.
Year
DOI
Venue
2020
10.1587/transfun.2019EAL2170
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
DocType
Volume
repair locality, availability, cyclic code, generalized quadrangle
Journal
E103A
Issue
ISSN
Citations 
7
0916-8508
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Qiang Fu100.68
Ruihu Li2109.04
Luobin Guo3144.00