Skip to main content
SpringerLink
Log in

On Good Polynomials over Finite Fields for Optimal Locally Recoverable Codes

  • Conference paper
  • First Online:
Codes, Cryptology and Information Security (C2SI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11445))

  • 732 Accesses

Abstract

[This is an extended abstract of the paper [3]] A locally recoverable (LRC) code is a code that enables a simple recovery of an erased symbol by accessing only a small number of other symbols. LRC codes currently form one of the rapidly developing topics in coding theory because of their applications in distributed and cloud storage systems. In 2014, Tamo and Barg have presented in a very remarkable paper a family of LRC codes that attain the maximum possible (minimum) distance (given code length, cardinality, and locality). The key ingredient for constructing such optimal linear LRC codes is the so-called r-good polynomials, where r is equal to the locality of the LRC code. In this extended abstract, we review and discuss good polynomials over finite fields for constructing optimal LRC codes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gopalan, P., Huang, C., Simitci, H., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58(11), 6925–6934 (2012)

    Article  MathSciNet  Google Scholar 

  2. Hou, X.-D.: Explicit evaluation of certain exponential sums of binary quadratic functions. Finite Fields Appl. 13(4), 843–868 (2007)

    Article  MathSciNet  Google Scholar 

  3. Liu, J., Mesnager, S., Chen, L.: New constructions of optimal locally recoverable codes via good polynomials. IEEE Trans. Inf. Theory 62(2), 889–899 (2018)

    Article  MathSciNet  Google Scholar 

  4. Liu, J., Mesnager, S., Tang, D.: Constructions of optimal locally recoverable codes via Dickson polynomials. In: Workshop WCC 2019: The Eleventh International Workshop on Coding and Cryptography (2019)

    Google Scholar 

  5. Micheli, G.: Constructions of locally recoverable codes which are optimal. arXiv:1806.11492 [cs.IT] (2018)

  6. Lidl, R., Niederreiter, H.: Finite Fields, Encyclopedia of Mathematics and its Applications, vol. 20. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  7. Papailiopoulos, D.S., Dimakis, A.G.: Locally repairable codes. IEEE Trans. Inf. Theory 60(10), 5843–5855 (2014)

    Article  MathSciNet  Google Scholar 

  8. Tamo, I., Barg, A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661–4676 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author is very grateful to Jian Liu for her valuable help. She also thanks the co-chairs program (in particular Claude Carlet for his careful reading) and the organizers of the conference C2SI 2019 for their nice invitation.

Author information

Authors and Affiliations

  1. LAGA, Department of Mathematics, University of Paris VIII and Paris XIII, UMR 7539; CNRS and Telecom ParisTech, 2 rue de la liberté, 93526, Saint-Denis cedex 02, France

    Sihem Mesnager

Authors
  1. Sihem Mesnager
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sihem Mesnager .

Editor information

Editors and Affiliations

  1. Université Paris 8, Saint-Denis, France

    Claude Carlet

  2. Institut MINES-TELECOM, Paris, France

    Sylvain Guilley

  3. Université de Caen, Caen, France

    Abderrahmane Nitaj

  4. Mohammed V University, Rabat, Morocco

    El Mamoun Souidi

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mesnager, S. (2019). On Good Polynomials over Finite Fields for Optimal Locally Recoverable Codes. In: Carlet, C., Guilley, S., Nitaj, A., Souidi, E. (eds) Codes, Cryptology and Information Security. C2SI 2019. Lecture Notes in Computer Science(), vol 11445. Springer, Cham. https://doi.org/10.1007/978-3-030-16458-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-16458-4_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-16457-7

  • Online ISBN: 978-3-030-16458-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation