Computing sharp recovery structures for locally recoverable codes

DOI10.1007/S10623-020-00746-7MaRDI QIDQ782862zbMATH OpenOpenAlexFDO

Authors Irene Márquez-Corbella, E. Martínez-Moro, Carlos Munuera

Publication date 29 July 2020

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

error-correcting codelocally recoverable codesharp recovery structures

Mathematics Subject Classification ID

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

Abstract: A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery structure as concise posible for an arbitrary linear code $mathcalC$ and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of $mathcalC$. Complexity issues are studied as well. Several examples are included.

Recommendations

• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• The minimum locality of linear codes
• Bounds on the size of locally recoverable codes
• A characterization of optimal locally repairable codes
• Locally recoverable codes from rational maps

Cites work

• scientific article; zbMATH DE number 1024000 (Why is no real title available?)
• A Family of Optimal Locally Recoverable Codes
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Codes of small defect
• Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
• Gröbner bases and combinatorics for binary codes
• Integrated interleaved codes as locally recoverable codes: properties and performance
• Locally Repairable Codes
• Locally recoverable codes on algebraic curves
• Minimal vectors in linear codes
• On the Locality of Codeword Symbols
• On the ideal associated to a linear code
• On the inherent intractability of certain coding problems (Corresp.)
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
• The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size

Cited in

(1)

• Locally recoverable codes from rational maps

Describes a project that uses

Uses Software

• MinT
• SageMath

This page was built for publication: Computing sharp recovery structures for locally recoverable codes

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