Computing sharp recovery structures for locally recoverable codes

DOI10.1007/S10623-020-00746-7zbMATH Open1442.14091arXiv1907.05316OpenAlexW3011847408MaRDI QIDQ782862FDOQ782862

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)

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.

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)

Cites Work

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

Uses Software

• SageMath
• MinT

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)