Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
From MaRDI portal
Publication:5224101
DOI10.1109/TIT.2019.2901492zbMath1432.94170arXiv1808.04558OpenAlexW2885726234WikidataQ128319454 ScholiaQ128319454MaRDI QIDQ5224101
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04558
Related Items (13)
Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ On binary locally repairable codes with distance four ⋮ A characterization of optimal locally repairable codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ New constructions of optimal \((r, \delta)\)-LRCs via good polynomials ⋮ Constructions of optimal locally recoverable codes via Dickson polynomials ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
This page was built for publication: Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
