New Bounds and Generalizations of Locally Recoverable Codes With Availability

DOI10.1109/TIT.2019.2897705zbMATH Open1432.94171OpenAlexW2913294625WikidataQ128438388 ScholiaQ128438388MaRDI QIDQ5224065FDOQ5224065

Authors: Stanislav Kruglik, Kamilla Nazirkhanova, Alexey Frolov 

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2019.2897705

zbMATH Keywords

minimum distanceupper and lower boundsLRC codesdistance properties of linear locally recoverable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

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)