Constructions and Properties of Linear Locally Repairable Codes
Loading...
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2016-03
Major/Subject
Mcode
Degree programme
Language
en
Pages
15
1129-1143
1129-1143
Series
IEEE TRANSACTIONS ON INFORMATION THEORY, Volume 62, issue 3
Abstract
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. It is also 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 the result provides a constructive method to find locally repairable codes. Finally, constructions of three infinite classes of optimal vector-linear locally repairable codes over a small alphabet independent of the code size are given.Description
Keywords
Codes, data storage systems, DISTRIBUTED STORAGE-SYSTEMS, POINTS, MBR, MSR
Other note
Citation
Ernvall , T , Westerbäck , T , Freij-Hollanti , R & Hollanti , C 2016 , ' Constructions and Properties of Linear Locally Repairable Codes ' , IEEE Transactions on Information Theory , vol. 62 , no. 3 , pp. 1129-1143 . https://doi.org/10.1109/TIT.2015.2512864