Skip to main content
Log in

A family of constacyclic codes over F 2 + uF 2 + vF 2 + uvF 2

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper studies (1 + u)-constacyclic codes over the ring F 2 + uF 2 + vF 2 + uvF 2. It is proved that the image of a (1+u)-constacyclic code of length n over F 2+uF 2+vF 2+uvF 2 under a Gray map is a distance invariant binary quasi-cyclic code of index 2 and length 4n. A set of generators of such constacyclic codes for an arbitrary length is determined. Some optimal binary codes are obtained directly from (1 + u)-constacyclic codes over F 2 + uF 2 + vF 2 + uvF 2.

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. I. F. Blake, Codes over certain rings, Inform. Control, 1972, 20: 396–404.

    Article  MathSciNet  MATH  Google Scholar 

  2. I. F. Blake, Codes over integer residue rings, Inform. Control, 1975, 29: 295–300.

    Article  MathSciNet  MATH  Google Scholar 

  3. A. R. Hammons Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Solé, The Z 4-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory, 1994, 40: 301–319.

    Article  MathSciNet  MATH  Google Scholar 

  4. V. Tarokh, N. Seshadri, and A. R. Calderbank, Space-time codes for high data rate wireless communication: Performance criterion and construction, IEEE Trans. Inform. Theory, 1998, 44: 744–765.

    Article  MathSciNet  MATH  Google Scholar 

  5. A. R. Calderbank and N. J. A. Sloane, Modular and p-adic cyclic codes, Des. Codes Cryptogr., 1995, 6: 21–35.

    Article  MathSciNet  MATH  Google Scholar 

  6. H. Q. Dinh and S. R. López-Permouth, Cyclic and negacyclic codes over finite chain rings, IEEE Trans. Inform. Theory, 2004, 50: 1728–1744.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Kanwar and S. R. López-Permouth, Cyclic codes over the integers modulo p m, Finite Fields Appl., 1997, 3: 334–352.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. Ling and J. Blackford, Z pk+1-linear codes, IEEE Trans. Inform. Theory, 2002, 48: 2592–2605.

    Article  MathSciNet  MATH  Google Scholar 

  9. G. H. Norton and A. Sǎlǎgean, On the structure of linear and cyclic codes over a finite chain ring, Appl. Algebra Eng. Comm. Comput., 2000, 10: 489–506.

    Article  MATH  Google Scholar 

  10. G. H. Norton and A. Sǎlǎgean, On the Hamming distance of linear codes over a finite chain ring, IEEE Trans. Inform. Theory, 2000, 46: 1060–1067.

    Article  MathSciNet  MATH  Google Scholar 

  11. B. Yildiz and S. Karadenniz, Linear codes over F 2 + uF 2 + vF 2 + uvF 2, Des. Codes Cryptogr., 2010, 54: 61–81.

    Article  MathSciNet  MATH  Google Scholar 

  12. B. Yildiz and S. Karadenniz, Cyclic codes over F 2+uF 2+vF 2+uvF 2, Des. Codes Cryptogr., 2011, 58: 221–234.

    Article  MathSciNet  MATH  Google Scholar 

  13. J. Wolfmann, Negacyclic and cyclic codes over Z 4, IEEE Trans. Inform. Theory, 1999, 45: 2527–2532.

    Article  MathSciNet  MATH  Google Scholar 

  14. J. Wolfmann, Binary images of cyclic codes over Z 4, IEEE Trans. Inform. Theory, 2001, 47: 1773–1779.

    Article  MathSciNet  MATH  Google Scholar 

  15. T. Abualrub and I. Siap, Constacyclic codes over F 2 + uF 2, J. Franklin Inst., 2009, 346: 520–529.

    Article  MathSciNet  MATH  Google Scholar 

  16. T. Blackford, Negacyclic codes over Z 4 of even length, IEEE Trans. Inform. Theory, 2003, 49: 1417–1424.

    Article  MathSciNet  MATH  Google Scholar 

  17. H. Q. Dinh, Constacyclic codes of length 2s over Galois extension rings of F 2 + uF 2, IEEE Trans. Inform. Theory, 2009, 55: 1730–1740.

    Article  MathSciNet  Google Scholar 

  18. X. Kai, S. Zhu, and P. Li, (1 + λu)-Constacyclic codes over Fp[u]〈u m〉, J. Franklin Inst., 2010, 347: 751–762.

    Article  MathSciNet  Google Scholar 

  19. J. Qian, L. Zhang, and S. Zhu, (1 + u)-Constacyclic and cyclic codes over F 2 + uF 2, Appl. Math. Lett., 2006, 19: 820–823.

    Article  MathSciNet  MATH  Google Scholar 

  20. A. Sălăgean, Repeated-root cyclic and negacyclic codes over finite chain rings, Discrete Appl. Math., 2006, 154: 413–419.

    Article  MathSciNet  MATH  Google Scholar 

  21. S. Zhu and X. Kai, The Hamming distances of negacyclic codes of length 2s over GR(2a,m), Journal of Systems Science & Complexity, 2008, 21(1): 60–66.

    Article  MathSciNet  MATH  Google Scholar 

  22. A. Bonnecaze and P. Udaya, Cyclic codes and self-dual codes over F 2 +uF 2, IEEE Trans. Inform. Theory, 1999, 45: 1250–1255.

    Article  MathSciNet  MATH  Google Scholar 

  23. M. Grassl, Bound on the minimum distance of linear codes, http://www.codetables.de.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoshan Kai.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant No. 60973125, the Natural Science Foundation of Anhui Province under Grant No. 1208085MA14, and the Fundamental Research Funds for the Central Universities under Grants Nos. 2012HGXJ0040 and 2011HGBZ1298.

This paper was recommended for publication by Editor Lei HU.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kai, X., Zhu, S. & Wang, L. A family of constacyclic codes over F 2 + uF 2 + vF 2 + uvF 2 . J Syst Sci Complex 25, 1032–1040 (2012). https://doi.org/10.1007/s11424-012-1001-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-012-1001-9

Key words

Navigation