Skip to main content
Erschienen in: Designs, Codes and Cryptography 9/2023

16.05.2023

Several families of irreducible constacyclic and cyclic codes

verfasst von: Zhonghua Sun, Xiaoqiang Wang, Cunsheng Ding

Erschienen in: Designs, Codes and Cryptography | Ausgabe 9/2023

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, several families of irreducible constacyclic codes over finite fields and their duals are studied. The weight distributions of these irreducible constacyclic codes and the parameters of their duals are settled. Several families of irreducible constacyclic codes with a few weights and several families of optimal constacyclic codes are constructed. As by-products, a family of \([2n, (n-1)/2, d \ge 2(\sqrt{n}+1)]\) irreducible cyclic codes over \({\textrm{GF}}(q)\) and a family of \([(q-1)n, (n-1)/2, d \ge (q-1)(\sqrt{n}+1)]\) irreducible cyclic codes over \({\textrm{GF}}(q)\) are presented, where n is a prime such that \({\textrm{ord}}_{2n}(q)=(n-1)/2\) and \({\textrm{ord}}_{(q-1)n}(q)=(n-1)/2\), respectively. The results in this paper complement earlier works on irreducible constacyclic and cyclic codes over finite fields.
Literatur
1.
2.
Zurück zum Zitat Berlekamp E.R.: Negacyclic codes for the Lee metric. In: Proceedings of the Conference on Combinatorial Mathematics and Its Applications, pp. 298–316. University of North Carolina Press, Chapel Hill (1968). Berlekamp E.R.: Negacyclic codes for the Lee metric. In: Proceedings of the Conference on Combinatorial Mathematics and Its Applications, pp. 298–316. University of North Carolina Press, Chapel Hill (1968).
3.
4.
5.
6.
Zurück zum Zitat 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).MathSciNetCrossRefMATH 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).MathSciNetCrossRefMATH
8.
Zurück zum Zitat Ding C., Tang C.: Designs from Linear Codes, 2nd edn World Scientific, Singapore (2022).CrossRefMATH Ding C., Tang C.: Designs from Linear Codes, 2nd edn World Scientific, Singapore (2022).CrossRefMATH
10.
Zurück zum Zitat 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). 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).
11.
12.
Zurück zum Zitat 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(2), 284–285 (1983).MathSciNetMATH 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(2), 284–285 (1983).MathSciNetMATH
13.
Zurück zum Zitat Heng Z., Ding C.: A construction of \(q\)-ary linear codes with irreducible cyclic codes. Des. Codes Cryptogr. 87, 1087–1108 (2019).MathSciNetCrossRefMATH Heng Z., Ding C.: A construction of \(q\)-ary linear codes with irreducible cyclic codes. Des. Codes Cryptogr. 87, 1087–1108 (2019).MathSciNetCrossRefMATH
14.
Zurück zum Zitat Huffman W.C., Pless V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003).CrossRefMATH Huffman W.C., Pless V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003).CrossRefMATH
15.
Zurück zum Zitat Kølve T.: Codes for Error Detection. World Scientfic, Singapore (2007).CrossRef Kølve T.: Codes for Error Detection. World Scientfic, Singapore (2007).CrossRef
16.
17.
Zurück zum Zitat Li F., Yue Q.: The primitive idempotents and weight distributions of irreducible constacyclic codes. Des. Codes Cryptogr. 86, 771–784 (2018).MathSciNetCrossRefMATH Li F., Yue Q.: The primitive idempotents and weight distributions of irreducible constacyclic codes. Des. Codes Cryptogr. 86, 771–784 (2018).MathSciNetCrossRefMATH
18.
19.
Zurück zum Zitat Lidl R., Niederreiter H.: Finite Fields. Addison-Wesly, New York (1983).MATH Lidl R., Niederreiter H.: Finite Fields. Addison-Wesly, New York (1983).MATH
20.
21.
23.
24.
Zurück zum Zitat Peterson W.W., Weldon E.J. Jr.: Error-Correcting Codes, 2nd edn MIT Press, Cambridge (1972).MATH Peterson W.W., Weldon E.J. Jr.: Error-Correcting Codes, 2nd edn MIT Press, Cambridge (1972).MATH
25.
Zurück zum Zitat Sharma A., Rani S.: Trace description and Hamming weights of irreducible constacyclic codes. Adv. Math. Commun. 12(1), 123–141 (2018).MathSciNetCrossRefMATH Sharma A., Rani S.: Trace description and Hamming weights of irreducible constacyclic codes. Adv. Math. Commun. 12(1), 123–141 (2018).MathSciNetCrossRefMATH
26.
Zurück zum Zitat Shi Z., Fu F.: The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes. Cryptogr. Commun. 12, 29–52 (2020).MathSciNetCrossRefMATH Shi Z., Fu F.: The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes. Cryptogr. Commun. 12, 29–52 (2020).MathSciNetCrossRefMATH
29.
Zurück zum Zitat Wang L., Sun Z., Zhu S.: Hermitian dual-containing narrow-sense constacyclic BCH codes and quantum codes. Quantum Inf. Process. 18, 323 (2019).MathSciNetCrossRefMATH Wang L., Sun Z., Zhu S.: Hermitian dual-containing narrow-sense constacyclic BCH codes and quantum codes. Quantum Inf. Process. 18, 323 (2019).MathSciNetCrossRefMATH
30.
31.
Zurück zum Zitat Zhu S., Sun Z., Li P.: A class of negacyclic BCH codes and its application to quantum codes. Des. Codes Cryptogr. 86, 2139–2165 (2018).MathSciNetCrossRefMATH Zhu S., Sun Z., Li P.: A class of negacyclic BCH codes and its application to quantum codes. Des. Codes Cryptogr. 86, 2139–2165 (2018).MathSciNetCrossRefMATH
Metadaten
Titel
Several families of irreducible constacyclic and cyclic codes
verfasst von
Zhonghua Sun
Xiaoqiang Wang
Cunsheng Ding
Publikationsdatum
16.05.2023
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 9/2023
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-023-01242-4

Weitere Artikel der Ausgabe 9/2023

Designs, Codes and Cryptography 9/2023 Zur Ausgabe

Premium Partner