Linear programming bounds for distributed storage codes
From MaRDI portal
Publication:2176298
DOI10.3934/amc.2020024zbMath1434.68157arXiv1710.04361OpenAlexW2972087398WikidataQ127241172 ScholiaQ127241172MaRDI QIDQ2176298
Ali Tebbi, Chi Wan Sung, Terence H. Chan
Publication date: 4 May 2020
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.04361
Linear programming (90C05) Bounds on codes (94B65) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Related Items (3)
Linear programming bounds for distributed storage codes ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ Perfect LRCs and \(k\)-optimal LRCs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming bounds for distributed storage codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Locality and Availability in Distributed Storage
- Bounds on the Size of Locally Recoverable Codes
- Locally Repairable Codes
- Explicit Maximally Recoverable Codes With Locality
- Codes With Local Regeneration and Erasure Correction
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- MDS array codes with independent parity symbols
- Network Coding for Distributed Storage Systems
- Constructions of Partial MDS Codes Over Small Fields
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
This page was built for publication: Linear programming bounds for distributed storage codes
