Codes with hierarchical locality from covering maps of curves
Abstract
Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the codeword without having to access each of the remaining coordinates. A subfamily of LRC codes with hierarchical locality (H-LRC codes) provides added flexibility to the construction by introducing several tiers of recoverability for correcting different numbers of erasures. We present a general construction of codes with 2-level hierarchical locality from maps between algebraic curves and specialize it to several code families obtained from quotients of curves by a subgroup of the automorphism group, including rational, elliptic, Kummer, and Artin-Schreier curves. We further address the question of H-LRC codes with availability, and suggest a general construction of such codes from fiber products of curves. Detailed calculations of parameters for H-LRC codes with availability are performed for Reed-Solomon- and Hermitian-like code families. Finally, we construct asymptotically good families of H-LRC codes from curves related to the Garcia-Stichtenoth tower.
Keywords
Cite
@article{arxiv.1807.05473,
title = {Codes with hierarchical locality from covering maps of curves},
author = {Sean Ballentine and Alexander Barg and Serge Vladuts},
journal= {arXiv preprint arXiv:1807.05473},
year = {2019}
}
Comments
V2: We added a construction of codes with two-level hierarchical locality and availability in each of the levels. \\ V3: The section on locality and availability has been rewritten; a new section was added with two general families of codes with two-level locality and availability in each of the levels, Sec. VIII.E