Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
From MaRDI portal
Publication:4615363
DOI10.1109/TIT.2018.2854717zbMath1427.94102arXiv1801.03623OpenAlexW2963911258WikidataQ129528405 ScholiaQ129528405MaRDI QIDQ4615363
Chen Yuan, Yuan Luo, Xing, Chaoping
Publication date: 28 January 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.03623
Related Items (17)
Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ On binary locally repairable codes with distance four ⋮ A characterization of optimal locally repairable codes ⋮ The minimum locality of linear codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ A construction of optimal locally recoverable codes ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ Near MDS codes with dimension 4 and their application in locally recoverable codes ⋮ A characterization of optimal constacyclic locally repairable codes ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ Constructions of near MDS codes which are optimal locally recoverable codes ⋮ Good polynomials for optimal LRC of low locality ⋮ Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length ⋮ The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
This page was built for publication: Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
