New Bounds and Generalizations of Locally Recoverable Codes With Availability
From MaRDI portal
Publication:5224065
Cited in
(5)- Codes for Distributed Storage
- Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
- Constructions of optimal locally recoverable codes via Dickson polynomials
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
- Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
This page was built for publication: New Bounds and Generalizations of Locally Recoverable Codes With Availability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224065)