Anticode-based locally repairable codes with high availability
From MaRDI portal
Publication:1696053
DOI10.1007/s10623-017-0358-0zbMath1412.94251OpenAlexW2606784425MaRDI QIDQ1696053
Natalia Silberstein, Alexander Zeh
Publication date: 14 February 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0358-0
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)
Related Items (9)
Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ A characterization of optimal locally repairable codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Constructions of optimal locally recoverable codes via Dickson polynomials ⋮ The complete hierarchical locality of the punctured simplex code ⋮ Locally recoverable codes correcting many erasures over small fields ⋮ Cyclic flats of binary matroids ⋮ Infinite families of optimal linear codes and their applications to distributed storage systems ⋮ Codes for Distributed Storage
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Blocking sets and partial spreads in finite projective spaces
- A new class of nonbinary codes meeting the Griesmer bound
- Locality and Availability in Distributed Storage
- Bounds on the Size of Locally Recoverable Codes
- Repair Locality With Multiple Erasure Tolerance
- Locally Repairable Codes
- Explicit Maximally Recoverable Codes With Locality
- Codes With Local Regeneration and Erasure Correction
- A Family of Optimal Locally Recoverable Codes
- Codes and Designs Related to Lifted MRD Codes
- On the Locality of Codeword Symbols
- Network Coding for Distributed Storage Systems
- A Bound for Error-Correcting Codes
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Introduction to Coding Theory
This page was built for publication: Anticode-based locally repairable codes with high availability
