A family of codes with variable locality and availability

DOI10.1007/S40863-022-00308-WMaRDI QIDQ6116630zbMATH OpenOpenAlexWikidataFDO

Authors Cicero Carvalho, Victor G. L. Neumann

Publication date 18 July 2023

Published in São Paulo Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.13487

zbMATH Keywords

codes with availabilitycodes with localitylocally recoverable codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this work we present a class of locally recoverable codes, i.e. codes where an erasure at a position $P$ of a codeword may be recovered from the knowledge of the entries in the positions of a recovery set $R_P$. The codes in the class that we define have availability, meaning that for each position $P$ there are several distinct recovery sets. Also, the entry at position $P$ may be recovered even in the presence of erasures in some of the positions of the recovery sets, and the number of supported erasures may vary among the various recovery sets.

Recommendations

• Constacyclic locally recoverable codes from their duals
• A characterization of optimal constacyclic locally repairable codes
• Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• The minimum locality of linear codes

Cites work

• Affine Cartesian codes
• Decoding affine variety codes using Gröbner bases
• Locality and Availability in Distributed Storage
• On the Locality of Codeword Symbols

Cited in

(5)

• Locality and Availability of Array Codes Constructed From Subspaces
• A characterization of optimal constacyclic locally repairable codes
• Constacyclic locally recoverable codes from their duals
• Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Optimal RS-like LRC codes of arbitrary length

This page was built for publication: A family of codes with variable locality and availability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116630)