RS-like locally recoverable codes with intersecting recovering sets

DOI10.1016/j.ffa.2020.101729zbMath1464.94075OpenAlexW3082969197MaRDI QIDQ1994945

Maheshanand Bhaintwal, Charul Rajput

Publication date: 18 February 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101729

zbMATH Keywords

RS-like LRC codesintersecting recovering setsLRC codes with availability

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60) Cyclic codes (94B15)

Cites Work

• Unnamed Item
• Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
• Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
• On the locality of codeword symbols in non-linear codes
• Optimal Locally Repairable Codes and Connections to Matroid Theory
• Locality and Availability in Distributed Storage
• Bounds on the Parameters of Locally Recoverable Codes
• Repair Locality With Multiple Erasure Tolerance
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields

This page was built for publication: RS-like locally recoverable codes with intersecting recovering sets