2016 · 12 citations · 13 references
ComputingComputer ScienceMathematicsAlgorithmsFault ToleranceFault-tolerant ComputingApproximation AlgorithmsCoding TheoryErasure CodingError Control CodingError-correcting CodesMatroid TheoryBounds On CodesCode OptimalityCodes Over Finite FieldsLinear CodesLocality ConstraintsLocally Repairable CodesMinimum DistanceMinimum Distance Bounds
Abstract—Constructions of optimal locally repairable codes (LRCs) in the case of (r + 1)- n and over small finite fields were stated as open problems for LRCs in [I. Tamo et al., “Optimal locally repairable codes and connections to matroid theory”, 2013 IEEE ISIT]. In this paper, these problems are studied by constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which (r + 1)- n. More precisely, linear codes for given length, dimension, and all-symbol locality are constructed with almost optimal minimum distance. ‘Almost optimal ’ refers to the fact that their minimum distance differs by at most one from the optimal value given by a known bound for LRCs. In addition to these linear LRCs, optimal LRCs which do not require a large field are constructed for certain classes of parameters. I.
13
Network Coding for Distributed Storage Systems
Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu et al. · IEEE Transactions on Information Theory · 2010 · 2K citations
On the Locality of Codeword Symbols
Parikshit Gopalan, Cheng Huang, Huseyin Simitci et al. · IEEE Transactions on Information Theory · 2012 · 862 citations