Conference
On Optimal Locally Repairable Codes with Super-Linear Length
Abstract
Optimal locally repairable codes with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order optimal when compared with the new upper bounds. The length of the codes is super linear in the alphabet size.
Authors
Cai H; Miao Y; Schwartz M; Tang X
Volume
00
Pagination
pp. 2818-2822
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
July 12, 2019
DOI
10.1109/isit.2019.8849226
Name of conference
2019 IEEE International Symposium on Information Theory (ISIT)