Special Issue on Recent Advances in Coding Theory and Cryptography In honor of Joachim Rosenthal
Guest Editors: Elisa Gorla, Anna-Lena Horlemann, Roxana Smarandache and Jens Zumbrägel

Abstract

In this paper, we give constructions for infinite sequences of finite nonlinear locally recoverable codes $𝒞 \subseteq \prod_{i = 1}^{N} 𝔽_{q_{i}}$ over a product of finite fields arising from basis expansions in algebraic number fields. The codes in our sequences have increasing length and size, constant rate, fixed locality, and minimum distance going to infinity.

Communicated by E. Gorla

In honor of Joachim Rosenthal’s 60th birthday

Keywords:

AMSC: 11T06

References

1. A. Barg, K. Haymaker, E. W. Howe, G. L. Matthews and A. Várilly-Alvarado , Locally recoverable codes from algebraic curves and surfaces, in Algebraic Geometry for Coding Theory and Cryptography (Springer, 2017), pp. 95–127. Crossref, Google Scholar
2. D. Bartoli, M. Montanucci and L. Quoos , Locally recoverable codes from automorphism group of function fields of genus $g \geq 1$ , IEEE Trans. Inform. Theory 66(11) (2020) 6799–6808. Crossref, Web of Science, Google Scholar
3. W. Bosma, J. Cannon and C. Playoust , The Magma algebra system. I. The user language, J. Symbolic Comput. 24(3-4) (1997) 235–265. Crossref, Web of Science, Google Scholar
4. A. Dukes, A. Ferraguti and G. Micheli , Optimal selection for good polynomials of degree up to five, Des. Codes Crypt. 90(6) (2022) 1427–1436. Crossref, Web of Science, Google Scholar
5. R. Freij-Hollanti, T. Westerbäck and C. Hollanti , Locally repairable codes with availability and hierarchy: matroid theory via examples, in Int. Zurich Seminar on Communications-Proceedings (ETH Zurich, 2016), pp. 45–49. Google Scholar
6. V. Guruswami , Constructions of codes from number fields, IEEE Trans. Inform. Theory 49(3) (2003) 594–603. Crossref, Web of Science, Google Scholar
7. H. W. Lenstra Jr. , Codes from algebraic number fields, in Mathematics and Computer Science, II, CWI Monographs, Vol. 4 (North-Holland, Amsterdam, 1986), pp. 95–104. Google Scholar
8. J. Liu, S. Mesnager and L. Chen , New constructions of optimal locally recoverable codes via good polynomials, IEEE Trans. Inform. Theory 64(2) (2018) 889–899. Crossref, Web of Science, Google Scholar
9. G. Micheli , Construction of locally recoverable codes which are optimal, IEEE Trans. Inform. Theory 66(1) (2020) 167–175. Crossref, Google Scholar
10. N. Silberstein, A. S. Rawat, O. O. Koyluoglu and S. Vishwanath , Optimal locally repairable codes via rank-metric codes, in Int. Symp. Information Theory (IEEE, 2013), pp. 1819–1823. Crossref, Google Scholar
11. I. Tamo and A. Barg , A family of optimal locally recoverable codes, IEEE Trans. Inform. Theory 60(8) (2014) 4661–4676. Crossref, Web of Science, Google Scholar