Locally recoverable codes on algebraic curves

DOI10.1109/TIT.2017.2700859zbMATH Open1372.94480arXiv1501.04904OpenAlexW2611420662MaRDI QIDQ5369845FDOQ5369845

Authors: Alexander Barg, Itzhak Tamo, Serge Vlăduţ 

Publication date: 19 October 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most r) other symbols. A family of linear LRC codes that generalize the classic construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg. In this paper we extend this construction to codes on algebraic curves. We give a general construction of LRC codes on curves and compute some examples, including asymptotically good families of codes derived from the Garcia- Stichtenoth towers. The local recovery procedure is performed by polynomial interpolation over r coordinates of the codevector. We also obtain a family of Hermitian codes with two disjoint recovering sets for every symbol of the codeword.

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

Recommendations

• Locally recoverable codes from algebraic curves and surfaces
• Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
• Locally recoverable codes from rational maps
• Codes with locality from cyclic extensions of Deligne-Lusztig curves
• Locally recoverable codes from algebraic curves with separated variables

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (36)

• Locally recoverable codes on the algebraic function fields
• Codes for Distributed Storage
• On good polynomials over finite fields for optimal locally recoverable codes
• Locally recoverable codes from algebraic curves with separated variables
• Locally recoverable codes from towers of function fields
• A characterization of optimal locally repairable codes
• On sequential locally repairable codes
• Higher Hamming weights for locally recoverable codes on algebraic curves
• Locally recoverable codes from algebraic curves and surfaces
• Optimal binary linear locally repairable codes with disjoint repair groups
• Extended integrated interleaved codes over any field with applications to locally recoverable codes
• RS-like locally recoverable codes with intersecting recovering sets
• New upper bounds and constructions of multi-erasure locally recoverable codes
• Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes
• New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
• On geometric Goppa codes from elementary abelian \(p\)-extensions of \(\mathbb{F}_{p^s}(x)\)
• Locally recoverable codes from planar graphs
• A construction of maximally recoverable codes
• Relaxed locally correctable codes
• Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
• Curve-lifted codes for local recovery using lines
• Toward good families of codes from towers of surfaces
• Hermitian-lifted codes
• Locally repairable codes with high availability based on generalised quadrangles
• Computing sharp recovery structures for locally recoverable codes
• Anticode-based locally repairable codes with high availability
• Title not available (Why is that?)
• Locality via partially lifted codes
• On Singleton-type bound of locally repairable codes
• Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
• The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
• Maximally recoverable LRCs: a field size lower bound and constructions for few heavy parities
• Codes with locality from cyclic extensions of Deligne-Lusztig curves
• Locally recoverable \(J\)-affine variety codes
• Locally recoverable codes correcting many erasures over small fields
• Locally recoverable codes from rational maps

This page was built for publication: Locally recoverable codes on algebraic curves

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