Constructions and Properties of Linear Locally Repairable Codes

DOI10.1109/TIT.2015.2512864MaRDI QIDQ2976948zbMATH OpenFDO

Authors Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this also gives a constructive method to find locally repairable codes. Constructions are given of three infinite classes of optimal vector-linear locally repairable codes over an alphabet of small size, not depending on the size of the code.

Cited in

(4)

• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• Nonlinear Repair of Reed-Solomon Codes
• On Optimal Locally Repairable Codes With Super-Linear Length
• Optimal quantum (r, )-locally repairable codes via classical ones

This page was built for publication: Constructions and Properties of Linear Locally Repairable Codes

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