Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1711.07703 (cs)
[Submitted on 21 Nov 2017]

Title:Construction of asymptotically good locally repairable codes via automorphism groups of function fields

Authors:Xudong Li, Liming Ma, Chaoping Xing
View PDF
Abstract:Locally repairable codes have been investigated extensively in recent years due to practical application in distributed storage as well as theoretical interest. However, not much work on asymptotical behavior of locally repairable codes has been done until now. In particular, there is a little result on constructive lower bound on asymptotical behavior of locally repairable codes. In this paper, we extend the construction given in \cite{BTV17} via automorphism groups of function field towers. The main advantage of our construction is to allow more flexibility of locality. Furthermore, we show that the Gilbert-Varshamov type bound on locally repairable codes can be improved for all sufficiently large alphabet size $q$.
Subjects: Information Theory (cs.IT); Number Theory (math.NT)
Cite as: arXiv:1711.07703 [cs.IT]
  (or arXiv:1711.07703v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1711.07703

Submission history

From: Liming Ma [view email]
[v1] Tue, 21 Nov 2017 10:36:50 UTC (84 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2017-11
Change to browse by:
cs
math
math.IT
math.NT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Xudong Li
Liming Ma
Chaoping Xing
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)