Conference
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
Abstract
Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed codes is super-linear in the alphabet size, which improves upon the well known pyramid codes, whose length is only linear in the alphabet size. The recoverable erasure patterns are also analyzed for the new …
Authors
Cai H; Schwartz M
Volume
00
Pagination
pp. 571-576
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
June 26, 2020
DOI
10.1109/isit44484.2020.9174051
Name of conference
2020 IEEE International Symposium on Information Theory (ISIT)