On Optimal Locally Repairable Codes With Super-Linear Length

DOI10.1109/TIT.2020.2977647MaRDI QIDQ5124470zbMATH OpenFDO

Authors Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.11942

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: Locally repairable codes which are optimal 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.

Recommendations

• New Constructions of Optimal Locally Repairable Codes With Super-Linear Length
• A characterization of optimal locally repairable codes
• Optimal Locally Repairable Codes: An Improved Bound and Constructions
• Constructions and Properties of Linear Locally Repairable Codes
• On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
• Constructions of two classes of optimal locally repairable codes
• An Integer Programming-Based Bound for Locally Repairable Codes
• Optimal binary linear locally repairable codes with disjoint repair groups
• On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes

Cited in

(18)

• The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
• Optimal cyclic locally repairable codes with unbounded length from their zeros
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
• Perfect LRCs and k-optimal LRCs
• scientific article; zbMATH DE number 7378653 (Why is no real title available?)
• Codes for Distributed Storage
• Codes in the sum-rank metric: fundamentals and applications
• New upper bounds and constructions of multi-erasure locally recoverable codes
• On Singleton-type bound of locally repairable codes
• Optimal ternary locally repairable codes
• Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
• On information-theoretic secure multiparty computation with local repairability
• Optimal (2, ) locally repairable codes via punctured simplex codes
• Weight distributions of two classes of optimal (r, )-locally repairable codes
• Bounds on the size of (r,)-locally repairable codes for fixed values q and d
• LRCS: duality, LP bounds, and field size
• Optimal quantum (r, )-locally repairable codes via classical ones

This page was built for publication: On Optimal Locally Repairable Codes With Super-Linear Length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124470)