| Author(s) | |
|---|---|
| Abstract |
The algebraic structures in term of polynomial generators of all constacyclic codes of length 2ps over the finite field Fpm are established. Among other results, all self-dual negacyclic codes of length 2ps, where p ≡ 1 (mod 4) (any m), or p ≡ 3 (mod 4) and m is even, are provided. It is also shown the non-existence of self-dual negacyclic codes of length 2ps, where p ≡ 3 (mod 4), m is odd, and self-dual cyclic codes of length 2ps, for any odd prime p. |
| Format | |
| Identifier(s) | |
| Publication Date |
2012-01-01
|
| Publication Title |
Elsevier
|
| Volume |
18
|
| Issue |
1
|
| First Page |
133
|
| Last Page |
143
|
| Keywords | |
| Subject | |
| Rights |
http://rightsstatements.org/vocab/InC/1.0/
|
| Community | |
| Permalink | https://oaks.kent.edu/mathpubs/19 |
Dinh, H. (2012). Repeated-Root Constacyclic Codes of Length 2p^s (1–). Elsevier. https://doi.org/10.1016/J.FFA.2011.07.003
Dinh, Hai. 2012. “Repeated-Root Constacyclic Codes of Length 2p^s”. Elsevier. https://doi.org/10.1016/J.FFA.2011.07.003.
Dinh, Hai. Repeated-Root Constacyclic Codes of Length 2p^s. Elsevier, 1 Jan. 2012, https://doi.org/10.1016/J.FFA.2011.07.003.