Repeated-root constacyclic codes of length 6lp^s
Author(s) -
Tingting Wu,
Li Liu,
Lanqiang Li,
Shixin Zhu
Publication year - 2020
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2020051
Subject(s) - mathematics , dual polyhedron , generator (circuit theory) , combinatorics , finite field , enumeration , discrete mathematics , algebra over a field , pure mathematics , physics , power (physics) , quantum mechanics
Let \begin{document}$ \mathbb{F}_{q} $\end{document} be a finite field with character \begin{document}$ p $\end{document} and \begin{document}$ p\neq{3},l\neq{3} $\end{document} be different odd primes. In this paper, we study constacyclic codes of length \begin{document}$ 6lp^s $\end{document} over finite field \begin{document}$ \mathbb{F}_{q} $\end{document} . The generator polynomials of all constacyclic codes and their duals are obtained. Moreover, we give the characterization and enumeration of linear complementary dual (LCD) and self-dual constacyclic codes of length \begin{document}$ 6lp^s $\end{document} over \begin{document}$ \mathbb{F}_{q} $\end{document} .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom