Skip to main content
Log in

Construction of optimal codes from a class of constacyclic codes

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

Abstract

In this paper, the structure of \((\alpha u+\beta (u-\delta ))\)-constacyclic codes of length n over the finite commutative non-local ring \(\frac{{\mathbb {F}}_{p^m}[u]}{\left\langle u^2-\delta u \right\rangle }\) is provided, where \(\alpha , \beta \) and \(\delta \) are units of \({\mathbb {F}}_{p^m}\). The structure of dual constacyclic codes is considered and the hull of all such codes is determined. Using that, the Hamming and symbol-pair distances of \((\alpha u+\beta (u-\delta ))\)-constacyclic code over the ring \(\frac{{\mathbb {F}}_{p^m}[u]}{\left\langle u^2-\delta u \right\rangle }\) are established for code length \(p^s\). As applications, the MDS and MDS symbol-pair codes among them are completely identified.

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. Batoul, A., Guenda, K., Kaya, A., Yildiz, B.: Cyclic isodual and formally self-dual codes over \(\mathbb{F}_q+v\mathbb{F}_q\). Eur. J. Pure Appl. Math. 8(1), 64–80 (2015)

    MathSciNet  MATH  Google Scholar 

  2. Berman, S.D.: Semisimple cyclic and abelian codes. II. Cybernetics 3(3), 17–23 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  3. Castagnoli, G., Massey, J.L., Schoeller, P.A., von Seemann, N.: On repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2), 337–342 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cengellenmis, Y.: On the cyclic codes over \({\mathbb{F}}_3+ v{\mathbb{F}}_3\). Int. J. Algebra 4(6), 253–259 (2010)

    MathSciNet  Google Scholar 

  5. Chen, B., Dinh, H.Q., Liu, H., Wang, L.: Constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\). Finite Fields Appl. 37, 108–130 (2016)

    Article  MathSciNet  Google Scholar 

  6. Chen, B., Lin, L., Liu, H.: Constacyclic symbol-pair codes: Lower bounds and optimal constructions. IEEE Trans. Inf. Theory 63(12), 7661–7666 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding, B., Zhang, T., Ge, G.: Maximum distance separable codes for b-symbol read channels. Finite Fields Appl. 49, 180–197 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dinh, H.Q.: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions. Finite Fields Appl. 14(1), 22–40 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dinh, H.Q.: Repeated-root constacyclic codes of prime power length. AMS Contemp. Math 480, 87–100 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dinh, H.Q.: Constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m}+ u\mathbb{F}_{p^m}\). J. Algebra 324(5), 940–950 (2010)

    Article  MathSciNet  Google Scholar 

  11. Dinh, H.Q., Dhompongsa, S., Sriboonchitta, S.: On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\). Discret. Math. 340(4), 832–849 (2017)

    Article  MATH  Google Scholar 

  12. Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: On the symbol-pair distance of repeated root constacyclic codes of prime power lengths. IEEE Trans. Inf. Theory 64(4), 2417–2430 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dinh, H.Q., Nguyen, H.D.T., Sriboonchitta, S., Vo, T.M.: Repeated-root constacyclic codes of prime power lengths over finite chain rings. Finite Fields Appl. 43, 22–41 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dinh, H.Q., Wang, X., Liu, H., Sriboonchitta, S.: On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths. Discret. Math. 343(4), 111 780 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kai, X., Zhu, S., Wang, L.: A family of constacyclic codes over \(\mathbb{F}_2 + u\mathbb{F}_2 + v\mathbb{F}_2 + uv\mathbb{F}_2\). J. Syst. Sci. Complexity 25, 1032–1040 (2012)

    Article  MathSciNet  Google Scholar 

  16. Kai, X., Zhu, S.: Negacyclic self-dual codes over finite chain rings. Des. Codes Crypt. 62(2), 161–174 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kai, X., Zhu, S., Li, P.: \((1+\lambda u)\)-constacyclic codes over \((1+\lambda u)\)-Constacyclic codes over \(\frac{\mathbb{F}_p[u]}{\langle }u^{m}\rangle \). J. Frankl. Inst. 347(5), 751–762 (2010)

    Article  MATH  Google Scholar 

  18. Kai, X., Zhu, S., Li, P.: A construction of new MDS symbol-pair codes. IEEE Trans. Inf. Theory 61(11), 5828–5834 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kai, X., Zhu, S., Zhao, Y., Luo, H., Chen, Z.: New MDS symbol-pair codes from repeated-root codes. IEEE Commun. Lett. 22(3), 462–465 (2018)

    Article  Google Scholar 

  20. Li, S., Ge, G.: Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes. Des. Codes Crypt. 84(3), 359–372 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  21. van Lint, J.H.: Repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2), 343–345 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  22. Shi, M., Qian, L., Solé, P.: On self-dual negacirculant codes of index two and four. Des. Codes Crypt. 86(11), 2485–2494 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  23. Shi, M., Wu, R., Liu, Y., Solé, P.: Two and three weight codes over \(\mathbb{F}_p+u\mathbb{F}_p\). Cryptogr. Commun. 9(5), 637–646 (2017)

    Article  MathSciNet  Google Scholar 

  24. Shi, M., Zhu, S., Yang, S.: A class of optimal \(p\)-ary codes from one-weight codes over \(\frac{\mathbb{F}_p[u]}{u^m}\). J. Frankl. Inst. 350(5), 929–937 (2013)

    Article  MATH  Google Scholar 

  25. Wood, J.A.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121(3), 555–575 (1999)

  26. Zhu, S., Wang, L.: A class of constacyclic codes over \(\mathbb{F}_p+ v\mathbb{F}_p\) and its Gray image. Discret. Math. 311(23–24), 2677–2682 (2011)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Publisher's Note

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

The authors’ name are in alphabetical order. This paper is a part of Ph.D. thesis of Sampurna Satpati.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dinh, H.Q., Satpati, S. & Singh, A.K. Construction of optimal codes from a class of constacyclic codes. J. Appl. Math. Comput. 68, 3961–3977 (2022). https://doi.org/10.1007/s12190-021-01695-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-021-01695-7

Keywords

Mathematics Subject Classification

Navigation