Skip to main content
Log in

\({\mathbb {F}}_{2}[u]{\mathbb {F}}_{2}[u] \)-additive cyclic codes are asymptotically good

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Let \({\mathbb {F}}_{2}[u]={\mathbb {F}}_{2}+u{\mathbb {F}}_{2}\), \(u^2=0\). In this paper, we construct a class of \({\mathbb {F}}_{2}[u]{\mathbb {F}}_{2}[u]\)-additive cyclic codes generated by pairs of polynomials. We discuss their algebraic structure and show that generator matrices can be obtained for all codes in this class. We study asymptotic properties of this class of codes by using a Bernoulli random variable. Moreover, let \(0< \delta < 1\) be a real number and k and l be co-prime odd positive integers such that the entropy \(h_{2}(\frac{(k+l)\delta }{4})<\frac{1}{2},\)  we show that the relative minimum distance converges to \(\delta \) and the rates of the random codes converge to \(\frac{1}{k+l}\). Finally, we conclude that the \({\mathbb {F}}_{2}[u]{\mathbb {F}}_{2}[u] \)-additive cyclic codes are asymptotically good and provide some examples for this class of codes.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abualrub, T., Siap, I., Aydin, Nuh: \({\mathbb{Z}}_{2}{\mathbb{Z}}_{4}\)-additive cyclic codes. IEEE Trans. Inf. Theory 60, 1508–1514 (2014)

    Article  MATH  Google Scholar 

  2. Assmus, E.F., Mattson, H.F., Turyn, R.: Cyclic Codes. AF Cambridge Research Labs, Bedford, AFCRL, 66-348 (1966)

  3. Aydogdu, I., Gursoy, F.: \({\mathbb{Z} }_{2} {\mathbb{Z} }_{4} {\mathbb{Z} }_{8} \)-cyclic codes. J. Appl. Math. Comput. 60, 327–341 (2019)

    Article  Google Scholar 

  4. Bazzi, L.M.J., Mitter, S.K.: Some randomized code constructions from group actions. IEEE Trans. Inf. Theory 52, 3210–3219 (2006)

    Article  MATH  Google Scholar 

  5. Bhaintwal, M., Wasan, S.K.: On quasi-cyclic codes over \({\mathbb{Z} }_{q}\). Appl. Algebra Eng. Commun. Comput. 20, 459–480 (2009)

    Article  MATH  Google Scholar 

  6. Borges, J., Fernandez-Cordoba, C., Pujol, J., Rifa, J., Villanueva, M.: \({\mathbb{Z} }_{2} {\mathbb{Z} }_{4}\)-linear codes: generator matrices and duality. Des. Codes Cryptogr. 54, 167–179 (2010)

    Article  MATH  Google Scholar 

  7. Cao, Y.: Generalized quasi-cyclic codes over Galois rings; structural properties and enumeration. Appl. Algebra Eng. Commun. Comput. 22, 219–233 (2011)

    Article  MATH  Google Scholar 

  8. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)

    Book  MATH  Google Scholar 

  9. Diao, L., Gao, J., Lu, J.: Some results on \({\mathbb{Z} }_{p} {\mathbb{Z} }_{p}[u]\)-additive cyclic codes. Adv. Math. Commun. 14, 555–572 (2020)

    Article  Google Scholar 

  10. Dinh, H.Q., Yadav, B.P., Pathak, S., Prasad, A., Upadhyay, A.K., Yamaka, W.: \({\mathbb{Z} }_{4}{\mathbb{Z} }_{4}{\mathbb{Z} }_{4} \)-additive cyclic codes are asymptotically good, Applicable Algebra in Engineering. Commun. Comput. (2022). https://doi.org/10.1007/s00200-022-00557-4

    Article  Google Scholar 

  11. Fan, Y., Liu, H.: Quasi-cyclic codes of index \(1\frac{1}{2}\). https://arxiv.org/pdf/1505.02252.pdf (2015)

  12. Fan, Y., Liu, H.: Quasi-cyclic codes of index \(1\frac{1}{3}\). IEEE Trans. Inf. Theory 60, 6342–6347 (2016)

    Article  MATH  Google Scholar 

  13. Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes. IEEE Trans. Inf. Theory 62, 82–90 (2015)

    Article  MATH  Google Scholar 

  14. Fan, Y., Liu, H.: \({\mathbb{Z}}_{2}{\mathbb{Z}}_{4}\)-additive cyclic codes are asymptotically good. https://arxiv.org/abs/1911.09350 (2019)

  15. Gao, J., Hou, X.: \({\mathbb{Z} }_{4}\)-double cyclic codes are asymptotically good. IEEE Commun. Lett. 24, 1593–1597 (2020)

    Article  Google Scholar 

  16. Gao, J., Shi, M., Wu, T., Fu, F.: On double cyclic codes over \({\mathbb{Z} }_{4}\). Finite Fields Appl. 39, 233–250 (2016)

    Article  Google Scholar 

  17. Güneri, C., Özbudak, F., Özkaya, B., Saçıkara, E., Sepasdar, Z., Solé, P.: Structure and performance of generalized quasi-cyclic codes. Finite Fields Appl. 47, 183–202 (2017)

    Article  MATH  Google Scholar 

  18. Gupta, S.C., Kapoor, V.K.: Fundamental of Mathematical Statistics. Sultan Chand and Sons, Delhi (1970)

    Google Scholar 

  19. Huffman, W.C., Pless, V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  20. Hou, X., Gao, J.: \({\mathbb{Z} }_{p} {\mathbb{Z} }_{p}[v]\)-additive cyclic codes are asymptotically good. J. Appl. Math. Comput. 66, 871–884 (2021)

    Article  MATH  Google Scholar 

  21. Martinez-Perez, C., Willems, W.: Is the class of cyclic codes asymptotically good? IEEE Trans. Inf. Theory 52, 696–700 (2006)

    Article  MATH  Google Scholar 

  22. Mitzenmacher, M., Upfal, E.: Probability and Computing, Randomized Algorithm and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  23. Shi, M., Wu, R., Solé, P.: Asymptotically good additive cyclic codes exist. IEEE Commun. Lett. 22, 1980–1983 (2018)

    Article  Google Scholar 

  24. Siap, I., Kulhan, N.: The structure of generalized quasi cyclic codes. Appl. Math. E-Notes 5, 24–30 (2005)

    MATH  Google Scholar 

  25. Wu, T., Gao, J., Gao, Y., Fu, F.: \({\mathbb{Z} }_{2} {\mathbb{Z} }_{2} {\mathbb{Z} }_{4} \)-additive cyclic codes. Adv. Math. Commun. 12, 641–657 (2018)

    Article  Google Scholar 

  26. Yao, T., Zhu, S.: \({\mathbb{Z} }_{p} {\mathbb{Z} }_{p^s}\)-additive cyclic codes are asymptotically good. Cryptogr. Commun. 12, 253–264 (2019)

    Article  Google Scholar 

  27. Yao, T., Zhu, S., Kai, X.: \({\mathbb{Z} }_{p^r} {\mathbb{Z} }_{p^s}\)-additive cyclic codes are asymptotically good. Finite Fields Appl. 63, 101633 (2020)

    Article  MATH  Google Scholar 

  28. Yao, T., Zhu, S., Kai, X.: Additive cyclic codes are asymptotically good. Chin. J. Electron. 29, 859–864 (2020)

    Article  Google Scholar 

Download references

Acknowledgements

B.P. Yadav wants to thank CSIR for its financial support through file No. 09/1023(0018)/2016 EMR-I, and A.K. Upadhyay thanks SERB DST for their support through project MTR/2020/000006. A part of this paper was written during a stay of H.Q. Dinh and B.P. Yadav in the Vietnam Institute For Advanced Study in Mathematics (VIASM) in Summer 2022, they would like to thank the members of VIASM for their hospitality. This paper is partially supported by the Centre of Excellence in Econometrics, Faculty of Economics, Chiang Mai University, Thailand.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hai Q. Dinh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dinh, H.Q., Yadav, B.P., Pathak, S. et al. \({\mathbb {F}}_{2}[u]{\mathbb {F}}_{2}[u] \)-additive cyclic codes are asymptotically good. J. Appl. Math. Comput. 69, 1037–1056 (2023). https://doi.org/10.1007/s12190-022-01771-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-022-01771-6

Keywords

Mathematics Subject Classification

Navigation