Optimal Locally Repairable Codes Via Elliptic Curves

DOI10.1109/TIT.2018.2844216MaRDI QIDQ4611419zbMATH OpenOpenAlexWikidataFDO

Authors Xudong Li, Liming Ma, Chaoping Xing

Publication date 18 January 2019

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

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

zbMATH Keywords

elliptic curvesfamily of q-ary optimal locally repairable codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52) Linear codes (general theory) (94B05)

Abstract: Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg cite{TB14} first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, $q$-ary optimal locally repairable codes from subcodes of Reed-Solomon codes given in cite{TB14} have length upper bounded by $q$. Recently, it was shown through extension of construction in cite{TB14} that length of $q$-ary optimal locally repairable codes can be $q+1$ in cite{JMX17}. Surprisingly it was shown in cite{BHHMV16} that, unlike classical MDS codes, $q$-ary optimal locally repairable codes could have length bigger than $q+1$. Thus, it becomes an interesting and challenging problem to construct $q$-ary optimal locally repairable codes of length bigger than $q+1$. In the present paper, we make use of rich algebraic structures of elliptic curves to construct a family of $q$-ary optimal locally repairable codes of length up to $q+2sqrtq$. It turns out that locality of our codes can be as big as $23$ and distance can be linear in length.

Cited in

(29)

• Good polynomials for optimal LRC of low locality
• The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
• Optimal cyclic locally repairable codes with unbounded length from their zeros
• Codes with locality from cyclic extensions of Deligne-Lusztig curves
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
• Perfect LRCs and k-optimal LRCs
• Optimal Locally Repairable Codes and Connections to Matroid Theory
• Toward good families of codes from towers of surfaces
• Codes for Distributed Storage
• Codes in the sum-rank metric: fundamentals and applications
• A characterization of optimal locally repairable codes
• New upper bounds and constructions of multi-erasure locally recoverable codes
• Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• A characterization of optimal constacyclic locally repairable codes
• Optimal binary and ternary locally repairable codes with minimum distance 6
• Constacyclic locally recoverable codes from their duals
• Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Optimal ternary locally repairable codes
• On information-theoretic secure multiparty computation with local repairability
• On finding the largest minimum distance of locally recoverable codes: a graph theory approach
• Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
• Locally recoverable algebro-geometric codes from projective bundles
• Weight distributions of two classes of optimal (r, )-locally repairable codes
• Quantum (r, )-locally recoverable codes
• Two families of optimal quantum locally recoverable codes
• Cyclic (r, ) locally recoverable codes from their constacyclic and negacyclic subcodes
• Locally recoverable codes with multiple recovering sets from maximal curves

This page was built for publication: Optimal Locally Repairable Codes Via Elliptic Curves

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