Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes

DOI10.1109/TIT.2019.2911595zbMath1432.94169arXiv1810.08510OpenAlexW3103443408WikidataQ127962018 ScholiaQ127962018MaRDI QIDQ5211429

Thomas Westerbäck, Matthias Grezet, Ragnar Freij-Hollanti, Camilla Hollanti

Publication date: 28 January 2020

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

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

zbMATH Keywords

alphabet-dependent boundlocally repairable codes (LRCs)Singleton-type boundconsecutive residual codesextension of Cadambe-Mazumdar boundupper bound on asymptotic rate-distance tradeoff of LRCs

Mathematics Subject Classification ID

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

Related Items (3)

New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ The complete hierarchical locality of the punctured simplex code

This page was built for publication: Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes