Computing sharp recovery structures for locally recoverable codes

DOI10.1007/s10623-020-00746-7zbMath1442.14091arXiv1907.05316OpenAlexW3011847408MaRDI QIDQ782862

Irene Márquez-Corbella, Edgar 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) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cyclic codes (94B15)

Uses Software

• SageMath
• MinT

Cites Work

• Unnamed Item
• On the ideal associated to a linear code
• Integrated interleaved codes as locally recoverable codes: properties and performance
• Codes of small defect
• Gröbner bases and combinatorics for binary codes
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• On the inherent intractability of certain coding problems (Corresp.)
• Minimal vectors in linear codes
• 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
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems