Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Two families of linear codes with desirable properties from some functions over finite fields (2401.01135v2)

Published 2 Jan 2024 in cs.IT and math.IT

Abstract: Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic. In this paper, based on the augmentation technique, we present two families of linear codes from some functions over finite fields. The first family of linear codes is constructed from monomial functions over finite fields. The locality of them is determined and the weight distributions of two subfamilies of the codes are also given. An infinite family of locally recoverable codes which are at least almost optimal and some optimal recoverable codes are obtained from the linear codes. In particular, the two subfamilies of the codes are proved to be both optimally or almost optimally extendable and self-orthogonal. The second family of linear codes is constructed from weakly regular bent functions over finite fields and their weight distribution is determined. This family of codes is proved to have locality 3 for some cases and is conjectured to have locality 2 for other cases. Particularly, two families of optimal locally recoverable codes are derived from the linear codes. Besides, this family of codes is also proved to be both optimally or almost optimally extendable and self-orthogonal.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. J. Bringer, C. Carlet, H. Chabanne, S. Guilley, H. Maghrebi, “Orthogonal direct sum masking a smartcard friendly computation paradigm in a code with builtin protection against side-channel and fault attacks,” WISTP, vol. 8501, pp. 40–56, 1999.
  2. E. R. Berlekamp, H. Rumsey, G. Solomon, “On the solution of algebraic equations over finite fields,” Information and control, vol. 10, no. 6, pp. 553–564, 1967.
  3. V. Cadambe, A. Mazumdar, “An upper bound on the size of locally recoverable codes,” IEEE Int. Symp. Network Coding, pp. 1–5, 2013.
  4. C. Carlet, C. Güneri, S. Mesnager and F. Özbudak, “Construction of some codes suitable for both side channel and fault injection attacks,” Arithmetic of Finite Fields, vol. 11321, 95–107, 2018.
  5. C. Carlet, C. Li, S. Mesnager, “Some (almost) optimally extendable linear codes,” Des. Codes Cryptogr., vol. 87, pp. 2813–2834, 2019.
  6. B. Chen, J. Chen, “A construction of optimal (r,δ)𝑟𝛿(r,\delta)( italic_r , italic_δ )- locally recoverable codes,” IEEE Access, vol. 7, pp. 180349–180353, 2019.
  7. B. Chen, G. Zhang, W. Li, “New optimal linear codes with hierarchical locality,” IEEE Trans. Inf. Theory, vol. 69, no. 3, pp. 1544–1550,2023.
  8. C. Ding, “Linear codes from some 2222-designs,” IEEE Trans. Inf. Theory, vol. 60, pp. 3265–3275, 2015.
  9. C. Ding, J. Luo, H. Niederreiter, “Two-weight codes punctured from irreducible cyclic codes,” Proc. 1st Int. Workshop on Coding Theory Cryptogr., pp. 119–124, 2008.
  10. C. Ding, H. Niederreiter, “Cyclotomic linear codes of order 3333,” IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 2274–2277, 2007.
  11. K. Ding, C. Ding, “A class of two-weight and three-weight codes and their applications in secret sharing,” IEEE Trans. Inf. Theory, vol. 61, pp. 5835–5842, 2015.
  12. X. Du, R. Wang, C. Fan, “Infinite families of 2222-designs from a class of cyclic codes,” J. Comb. Des., vol. 28, no. 3, pp. 157–170, 2020.
  13. P. Gopalan, C. Huang, H. Simitci, S. Yekhanin, “On the locality of codeword symbols,” IEEE Trans. Inf. Theory, vol. 58, no. 11, pp. 6925–6934, 2012.
  14. Q. Fu, R. Li, L. Guo, L. Lv, “Locality of optimal binary codes,” Finite Fields Appli., vol. 48, pp. 371–394, 2017.
  15. Q. Fu, R. Li, L. Guo, G. Chen, “Singleton-type optimal LRCs with minimum distance 3 and 4 from projective code,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. 104, no. 1, pp. 319–323, 2021.
  16. P. Huang, E. Yaakobi, H. Uchikawa, P. Siegel, “Binary linear locally repairable codes,” IEEE Trans. Inf. Theory, vol. 62, no. 11, pp. 6268–6283, 2016.
  17. Z. Heng, Q. Wang, C. Ding, “Two families of optimal linear codes and their subfield codes,” IEEE Trans. Inf. Theory, vol. 66, no. 11, pp. 6872–6883, 2020.
  18. Z. Heng, X. Wang, X. Li, “Constructions of cyclic codes and extended primitive cyclic codes with their applications,” Finite Fields Appli., vol. 89, pp. 102208, 2023.
  19. Z. Heng, D. Li, J. Du, F. Chen, “A family of projective two-weight linear codes,” Des. Codes Cryptogr., vol. 89, pp. 1993–2007, 2021.
  20. Z. Heng, D. Li, F. Liu, “Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes,” Des. Codes Cryptogr., vol. 91, pp. 3953–3976, 2023.
  21. T. Helleseth, A. Kholosha, “Monomial and quadratic bent functions over the finite fields of odd characteristic,” IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 2018–2032, 2006.
  22. T. Helleseth, A. Kholosha, “New binomial bent functions over the finite fields of odd characteristic,” IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4646–4652, 2010.
  23. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, S. Yekhanin, “Erasure coding in windows azure storage,” Proc. USENIX Annu. Tech. Conf., 2012, Boston, MA, USA.
  24. M. Kiermaier, S. Kurz, “On the Lengths of Divisible Codes,” IEEE Trans. Inf. Theory, vol. 66, no. 7, pp. 4051–4060, 2020.
  25. C. Li, S. Bae, J. Ahn, S. Yang, Z. Yao, “Complete weight enumerators of some linear codes and their applications,” Des. Codes Cryptogr., vol. 81, pp. 153–168, 2016.
  26. R. Li, S. Yang, Y. Rao, Q. Fu, “On binary locally repairable codes with distance four,” Finite Fields Appli., vol. 72, pp. 101793, 2021.
  27. X. Li, Z. Heng, “Constructions of near MDS codes which are optimal locally recoverable codes,” Finite Fields Appl., vol. 88, pp. 102184, 2023.
  28. X. Li, Z. Heng, “Self-orthogonal codes from p𝑝pitalic_p-divisible codes,” arxiv: 2311.11634v1, 2023.
  29. Y. Liu, C. Ding, C. Tang, “Shortened linear codes over finite fields,” IEEE Trans. Inf. Theory, vol. 67, no. 8, pp. 5119–5132, 2021.
  30. S. Mesnager, “Linear codes with few weights from weakly regular bent functions based on a generic construction,” Cryptogr. Commun., vol. 9, pp. 71–84, 2017.
  31. X. Quan, Q. Yue, L. Hu, “Some constructions of (almost) optimally extendable linear codes,” Adv. Math. Commun., pp. 2022027, 2022.
  32. M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, D. Borthakur, “Xoring elephants: novel erasure codes for big data,” Proceedings of the VLDB Endowment, vol. 6, no. 5, pp. 325–336, 2013.
  33. C. Tang, C. Ding, “An infinite family of linear codes supporting 4444-designs,” IEEE Trans. Inf. Theory, vol. 67, no. 1, pp. 244–254, 2021.
  34. C. Tang, C. Ding, M. Xiong, “Codes, differentially δ𝛿\deltaitalic_δ-uniform functions, and t𝑡titalic_t-designs,” IEEE Trans. Inf. Theory, vol. 66, no. 6, pp. 3691–3703, 2020.
  35. C. Tang, N. Li, Y. Qi, Z. Zhou, T. Helleseth, “Linear codes with two or three weights from weakly regular bent functions,” IEEE Trans. Inf. Theory, vol. 62, no. 3, pp. 1166–1176, 2016.
  36. I. Tamo, A. Barg, “A Family of Optimal Locally Recoverable Codes,” IEEE Trans. Inf. Theory, vol. 60, no. 8, pp. 4661–4676, 2014.
  37. P. Tan, C. Fan, C. Ding, C. Tang, Z. Zhou, “The minimum locality of linear codes,” Des. Codes Cryptogr., vol. 91, no. 1, pp. 83–114, 2023.
  38. X. Wang, Z. Heng, “Several families of self-orthogonal codes and their applications in optimal quantum codes and LCD codes,” IEEE Trans. Inf. Theory, doi: 10.1109/TIT.2023.3332332.
  39. L. Xu, Z. Zhou, J. Zhang, S. Mesnager, “Optimal quaternary (r,δ)𝑟𝛿(r,\delta)( italic_r , italic_δ )- locally recoverable codes: their structures and complete classification,” Des. Codes Cryptogr., vol. 91, no. 4, 1495–1526, 2023.
  40. Z. Zhou, C. Ding, “Seven classes of three-weight cyclic codes,” IEEE Trans. Commun., vol. 61, no. 10, pp. 4120–4126, 2013.
  41. Z. Zhou, “Three-weight ternary linear codes from a family of cyclic difference sets,” Des. Codes Cryptogr., vol. 86, pp. 2513–2523, 2018.
  42. Z. Zhou, X. Li, C. Tang, C. Ding, “Binary LCD codes and self-orthogonal codes from a generic construction,” IEEE Trans. Inf. Theory, vol 65, no. 1, pp. 16–27, 2018.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now