Papers
Topics
Authors
Recent
Search
2000 character limit reached

Mathematical LoRE: Local Recovery of Erasures using Polynomials, Curves, Surfaces, and Liftings

Published 26 Dec 2023 in cs.IT, math.AC, math.AG, and math.IT | (2312.16314v2)

Abstract: Employing underlying geometric and algebraic structures allows for constructing bespoke codes for local recovery of erasures. We survey techniques for enriching classical codes with additional machinery, such as using lines or curves in projective space for local recovery sets or products of curves to enhance the availability of data.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. S. Ball. On large subsets of a finite vector space in which every subset of basis size is a basis. J. Eur. Math. Soc, 14(3):733–748, 2012.
  2. Locally recoverable codes from algebraic curves and surfaces. In Algebraic Geometry for Coding Theory and Cryptography, pages 95–127. Springer, 2017.
  3. Locally recoverable codes on algebraic curves. In 2015 IEEE International Symposium on Information Theory (ISIT), pages 1252–1256, 2015.
  4. Locally recoverable codes on algebraic curves. IEEE Transactions on Information Theory, 63(8):4928–4939, 2017.
  5. Explicit optimal-length locally repairable codes of distance 5. In 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 800–804, 2018.
  6. On the locality of codeword symbols. IEEE Transactions on Information Theory, 58(11):6925–6934, 2012.
  7. V. D. Goppa. Algebraico-geometric codes. Izv. Akad. Nauk SSSR Ser. Mat., 46:762–781, 1982.
  8. New affine-invariant codes from lifting. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS ’13, page 529–540, New York, NY, USA, 2013. Association for Computing Machinery.
  9. V. Guruswami and M. Wootters. Repairing reed-solomon codes. IEEE Transactions on Information Theory, 63(9):5684–5698, 2017.
  10. How long can optimal locally repairable codes be? IEEE Transactions on Information Theory, 65(6):3662–3670, 2019.
  11. Locally recoverable codes with availability t≥2𝑡2t\geq 2italic_t ≥ 2 from fiber products of curves. Advances in Mathematics of Communications, 12(2):317–336, 2018.
  12. Construction of optimal locally repairable codes via automorphism groups of rational function fields. IEEE Transactions on Information Theory, 66(1):210–221, 2020.
  13. Optimal locally repairable codes via elliptic curves. IEEE Transactions on Information Theory, 65(1):108–117, 2019.
  14. Hermitian-lifted codes. Designs, Codes and Cryptography, 2021.
  15. Optimal locally repairable codes of distance 3 and 4 via cyclic codes. IEEE Transactions on Information Theory, 65(2):1048–1053, 2019.
  16. Norm-trace-lifted codes over binary fields. In 2022 IEEE International Symposium on Information Theory (ISIT), pages 3079–3084, 2022.
  17. G. Micheli. Constructions of locally recoverable codes which are optimal. IEEE Transactions on Information Theory, 66(1):167–175, 2020.
  18. Locally repairable codes. In 2012 IEEE International Symposium on Information Theory Proceedings, pages 2771–2775, 2012.
  19. Locality and availability in distributed storage. IEEE Transactions on Information Theory, 62(8):4481–4493, 2016.
  20. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8(2):300–304, 1960.
  21. Locally recoverable codes on surfaces. IEEE Transactions on Information Theory, 67(9):5765–5777, 2021.
  22. I. Tamo and A. Barg. Bounds on locally recoverable codes with multiple recovering sets. In 2014 IEEE International Symposium on Information Theory, pages 691–695, 2014.
  23. I. Tamo and A. Barg. A family of optimal locally recoverable codes. IEEE Transactions on Information Theory, 60(8):4661–4676, 2014.
  24. Bounds on the parameters of locally recoverable codes. IEEE Transactions on information theory, 62(6):3070–3083, 2016.
  25. The Sage Developers. SageMath, the Sage Mathematics Software System (Version x.y.z), YYYY. https://www.sagemath.org.
  26. Modular curves, shimura curves, and goppa codes, better than varshamov-gilbert bound. Mathematische Nachrichten, 109(1):21–28, 1982.
  27. How to construct curves over finite fields with many points. In Arithmetic geometry (Cortona, 1994), Symposia Mathematica XXXVII (1997), pages 169–189. Cambridge: Cambridge University Press, 1995.
  28. A. Wang and Z. Zhang. Repair locality with multiple erasure tolerance. IEEE Transactions on Information Theory, 60(11):6979–6987, 2014.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 4 tweets with 23 likes about this paper.

Sign Up for Free