Skip to main content
Log in

On the Gray images of some constacyclic codes over F p + u F p + u 2 F p

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

Abstract

Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over F p + u F p + u 2 F p and codes over F p is defined, where p is an odd prime. By means of this map, it is shown that the Gray image of a linear (1+u+u 2)-constacyclic code over F p + u F p + u 2 F p of length n is a repeated-root cyclic code over F p of length pn. Furthermore, some examples of optimal linear cyclic codes over F 3 from (1 + u + u 2)-constacyclic codes over F 3 + u F 3 + u 2 F 3 are given.

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. Wolfmann J, Negacyclic and cyclic codes over Z4, IEEE Trans. Inform. Theory, 1999, 45(7): 2527–2532.

    Article  MathSciNet  MATH  Google Scholar 

  2. Tapia-Recillas H and Vega G, A generalization of negacyclic codes, Proc. Int. Workshop on Coding and Cryptography, Eds. by Augot D and Carlet C, 2001, 519–529.

    Google Scholar 

  3. Wolfmann J, Binary images of cyclic codes over Z4, IEEE Trans. Inform. Theory, 2001, 47(5): 1773–1779.

    Article  MathSciNet  MATH  Google Scholar 

  4. Ling S and Blackford J T, Zpk+1-linear codes, IEEE Trans. Inform. Theory, 2002, 48(9): 2592–2605.

    Article  MathSciNet  MATH  Google Scholar 

  5. Bachoc C, Applications of coding theory to the construction of modular lattices, J. Combin. Theory Ser. A, 1997, 78(1): 92–119.

    Article  MathSciNet  MATH  Google Scholar 

  6. Qian J F, Zhang L N, and Zhu S X, (1+u)-constacyclic and cyclic codes over the ring F2 +uF 2, Applied Mathematics Letters, 2006, 19(8): 820–823.

    Article  MathSciNet  MATH  Google Scholar 

  7. Qian J F, Zhang L N, and Zhu S X, Constacyclic and cyclic codes over F2 + uF2 + u 2F2, IEICE Trans. Fundamentals, 2006, E89-A(6): 1863–1865.

    Article  MathSciNet  Google Scholar 

  8. Amarra M C V and Nemenzo F R, On (1-u)-cyclic codes overFpk +uFpk, Applied Mathematics Letters, 2008, 21(11): 1129–1133.

    Article  MathSciNet  MATH  Google Scholar 

  9. Abualrub T and Siap T, Constacyclic codes over F2 + uF2, J. Franklin Inst., 2009, 346(5): 520–529.

    Article  MathSciNet  MATH  Google Scholar 

  10. Cengellenmis Y, On (1 - u m)-cyclic codes overF2 + uF2 + u 2F2 + u 3F2 + ··· + u mF2, Int. J. Contemp. Math. Sciences, 2009, 4(20): 987–992.

    MathSciNet  MATH  Google Scholar 

  11. Cengellenmis Y, On some special codes over Fp +uFp +u 2Fp, Applied Mathematics and Computation, 2011, 218(3): 720–722.

    MathSciNet  MATH  Google Scholar 

  12. Kai X S, Zhu S X, and Li P, (1 + u)-constacyclic codes over Fp[u]/u m, J. Franklin Inst., 2010, 347(5): 751–762.

    Article  MathSciNet  MATH  Google Scholar 

  13. Karadenniz S and Yildiz B, (1 + v)-constacyclic codes over F2 + uF2 + vF2 + uvF2, J. Franklin Inst., 2011, 348(9): 2625–2632.

    Article  MathSciNet  Google Scholar 

  14. Udomkavanicha P and Jitman S, On the Gray image of (1 - u m)-cyclic codes over Fpk + uFpk + ··· + u mFpk, Int. J. Contemp. Math. Sciences, 2009, 4(26): 1265–1272.

    Google Scholar 

  15. Zhu S X and Wang L Q, A class of constacyclic codes over Fp +vFp and its Gray image, Discrete Mathematics, 2011, 311(24): 2677–2682.

    Article  MathSciNet  MATH  Google Scholar 

  16. Kai X S, Zhu S X, and Wang L Q, A class of constacyclic codes over F2 + uF2 + vF2 + uvF2, J. Syst. Sci. Complex., 2012, 25(5): 1032–1040.

    Article  MathSciNet  Google Scholar 

  17. Yu H F, Zhu S X, and Kai X S, (1-uv)-constacyclic codes over Fp +uFp +vFp +uvFp, Journal of Systems Science and Complexity, 2014, 27(4): 811–816.

    Article  MathSciNet  Google Scholar 

  18. Qian J F, Zhang L N, and Zhu S X, Cyclic codes codes over Fp + uFp + ··· + u k-1Fp, IEICE Trans. Fundamentals, 2005, E88-A(3): 795–797.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haifeng Yu.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant No. 61370089, the Open Research Fund of National Mobile Communications Research Laboratory, Southeast University under Grant No. 2014D04, the Natural Science Fund of Education Department of Anhui province under Grant No. KJ2013Z276, the Fundamental Research Funds of Hefei University under Grant No. 10KY01ZD, the Key construction discipline Funds of Hefei University under Grant No. 2014XK08, and the Natural Science Key Fund of Education Department of Anhui Province under Grant No. KJ2015A226.

This paper was recommended for publication by Editor DENG Yingpu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, H., Zhu, S. & Kai, X. On the Gray images of some constacyclic codes over F p + u F p + u 2 F p . J Syst Sci Complex 29, 842–849 (2016). https://doi.org/10.1007/s11424-015-4316-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-015-4316-5

Keywords

Navigation