Binary Linear Locally Repairable Codes
From MaRDI portal
Publication:2976506
DOI10.1109/TIT.2016.2605119zbMath1359.94704arXiv1511.06960OpenAlexW2962775071MaRDI QIDQ2976506
Eitan Yaakobi, Hironori Uchikawa, Pengfei Huang, Paul H. Siegel
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/1511.06960
Related Items (12)
Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ Batch Codes from Hamming and Reed-M\"uller Codes ⋮ On binary locally repairable codes with distance four ⋮ Locality of optimal binary codes ⋮ The minimum locality of linear codes ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ Theory behind quantum error correcting codes: an overview ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Codes for Distributed Storage ⋮ On the locality of quasi-cyclic codes over finite fields
This page was built for publication: Binary Linear Locally Repairable Codes
