Skip to main content

Two Classes of Constacyclic Codes with Variable Parameters

  • Conference paper
  • First Online:
Arithmetic of Finite Fields (WAIFI 2022)

Abstract

Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are closely related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes are of theoretical importance. On the other hand, constacyclic codes are important in practice, as they have rich algebraic structures and may have efficient decoding algorithms. In this extended abstract, two classes of constacyclic codes are constructed using a general construction of constacyclic codes with cyclic codes. The first class of constacyclic codes is motivated by the punctured Dilix cyclic codes, and the second class is motivated by the punctured generalised Reed-Muller codes. The two classes of constacyclic codes contain optimal linear codes. The parameters of the two classes of constacyclic codes are analysed, and some open problems are presented in this extended abstract.

C. Ding’s research was supported by The Hong Kong Research Grants Council, Proj. No. 16301522, Z. Sun’s research was supported by The National Natural Science Foundation of China under Grant Number 62002093. X. Wang’s research was supported by The National Natural Science Foundation of China under Grant Number 12001175.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abdukhalikov, K., Ho, D.: Extended cyclic codes, maximal arcs and ovoids. Des. Codes Crypt. 89(10), 2283–2294 (2021). https://doi.org/10.1007/s10623-021-00915-2

    Article  MathSciNet  MATH  Google Scholar 

  2. Assmus, E.F., Jr., Key, J.D.: Polynomial codes and finite geometries. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1269–1343. Elsevier, Amsterdam (1998)

    Google Scholar 

  3. Ballet, S., Rolland, R.: On low weight codewords of generalized affine and projective Reed-Muller codes. Des. Codes Cryptogr. 73, 271–297 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Berger, T.P., de Maximy, L.: Cyclic projective reed-muller codes. In: Boztaş, S., Shparlinski, I.E. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 77–81. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45624-4_8

    Chapter  MATH  Google Scholar 

  5. Blackford, E.R.: Negacyclic codes for the Lee metric. In: Proceedings of the Conference on Combinatorial Mathematics and its Applications, pp. 298–316. Chapel Hill, NC (1968)

    Google Scholar 

  6. Chen, B., Dinh, H.Q., Fan, Y., Ling, S.: Polyadic constacyclic codes. IEEE Trans. Inf. Theory 61(9), 4895–4904 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, B., Fan, Y., Lin, L., Liu, H.: Constacyclic codes over finite fields. Finite Fields Appl. 18, 1217–1231 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dahl, C., Pedersen, J.P.: Cyclic and pseudo-cyclic MDS codes of length \(q+1\). J. Comb. Theory Ser. A 59, 130–133 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Danev, D., Dodunekov, S., Radkova, D.: A family of constacyclic ternary quasi-perfect codes with covering radius 3. Des. Codes Cryptogr. 59, 111–118 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ding, C., Li, C., Xia, Y.: Another generalization of the Reed-Muller codes. Finite Fields Appl. 53, 147–174 (2018)

    Article  Google Scholar 

  11. Ding, C., Tang, C.: Designs from Linear Codes, 2nd edn. World Scientific, Singapore (2022)

    Book  MATH  Google Scholar 

  12. Ding, P., Key, J.D.: Subcodes of the projective generalized Reed-Muller codes spanned by minimum-weight vectors. Des. Codes Cryptogr. 26, 197–211 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dong, X., Yin, S.: The trace representation of \(\lambda \)-constacyclic codes over \(\mathbb{F} _q\). J. Liaoning Normal Univ. (Nat. Sci. ed.) 33, 129–131 (2010)

    Google Scholar 

  14. Fang, W., Wen, J., Fu, F.: A \(q\)-polynomial approach to constacyclic codes. Finite Fields Appl. 47, 161–182 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  15. Georgiades, J.: Cyclic \((q+1, k)\)-codes of odd order \(q\) and even dimension \(k\) are not optimal. Atti Sent. Mat. Fis. Univ. Modena 30, 284–285 (1982)

    MathSciNet  MATH  Google Scholar 

  16. Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de

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

    Book  MATH  Google Scholar 

  18. Krishna, A., Sarwate, D.V.: Pseudocyclic maximum-distance-separable codes. IEEE Trans. Inf. Theory 36(4), 880–884 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lachaud, G.: Projective reed-muller codes. In: Cohen, G., Godlewski, P. (eds.) Coding Theory 1986. LNCS, vol. 311, pp. 125–129. Springer, Heidelberg (1988). https://doi.org/10.1007/3-540-19368-5_13

    Chapter  Google Scholar 

  20. Li, F., Yue, Q., Liu, F.: The weight distribution of constacyclic codes. Adv. Math. Commun. 11(3), 471–480 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  21. Li, F., Yue, Q.: The primitive idempotents and weight distributions of irreducible constacyclic codes. Des. Codes Cryptogr. 86, 771–784 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  22. Li, S.: On the weight distribution of second order Reed-Muller codes and their relatives. Des. Codes Cryptogr. 87, 2447–2460 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  23. Lidl, R., Niederreiter, H.: Finite Fields. Addison-Wesly, New York (1983)

    MATH  Google Scholar 

  24. Liu, Y., Li, R., Lv, L., Ma, Y.: A class of constacyclic BCH codes and new quantum codes. Quantum Inf. Process. 16(3), 1–16 (2017). https://doi.org/10.1007/s11128-017-1533-y

  25. Mi, J., Cao, X.: Constructing MDS Galois self-dual constacyclic codes over finite fields. Discret. Math. 334(6), 1–15 (2021)

    MathSciNet  MATH  Google Scholar 

  26. Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IEEE Trans. Comput. 3, 6–12 (1954)

    Google Scholar 

  27. Pedersen, J.P., Dahl, C.: Classification of pseudo-cyclic MDS codes. IEEE Trans. Inf. Theory 37(2), 365–370 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  28. Peterson, W.W., Weldon, E.J., Jr.: Error-Correcting Codes, 2nd edn. MIT Press, Cambridge (1972)

    MATH  Google Scholar 

  29. Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IRE Trans. Inf. Theory 4, 38–49 (1954)

    MathSciNet  Google Scholar 

  30. Wang, L., Sun, Z., Zhu, S.: Hermitian dual-containing narrow-sense constacyclic BCH codes and quantum codes. Quantum Inf. Process. 18(10), 1–40 (2019). https://doi.org/10.1007/s11128-019-2440-1

    Article  MathSciNet  MATH  Google Scholar 

  31. Wolfmann, J.: Projective two-weight irreducible cyclic and constacyclic codes. Finite Fields Appl. 14(2), 351–360 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  32. Sharma, A., Rani, S.: Trace description and Hamming weights of irreducible constacyclic codes. Adv. Math. Commun. 12(1), 123–141 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  33. Shi, Z., Fu, F.: The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes. Cryptogr. Commun. 12, 29–52 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  34. Sørensen, A.: Projective Reed-Muller codes. IEEE Trans. Inf. Theory 37(6), 1567–1576 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  35. Sun, S., Zhu, S., Wang, L.: A class of constacyclic BCH codes. Cryptogr. Commun. 12, 265–284 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  36. Zhu, S., Sun, Z., Li, P.: A class of negacyclic BCH codes and its application to quantum codes. Des. Codes Cryptogr. 86(10), 2139–2165 (2018)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The first author thanks Sihem Mesnager and Zhengchun Zhou for inviting him to present the talk at WAIFI 2022.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cunsheng Ding .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ding, C., Sun, Z., Wang, X. (2023). Two Classes of Constacyclic Codes with Variable Parameters. In: Mesnager, S., Zhou, Z. (eds) Arithmetic of Finite Fields. WAIFI 2022. Lecture Notes in Computer Science, vol 13638. Springer, Cham. https://doi.org/10.1007/978-3-031-22944-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22944-2_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-22943-5

  • Online ISBN: 978-3-031-22944-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics