Repeated-root constacyclic codes of length 2ps over $\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+u^{2}\mathbb {F}_{p^{m}}$
- 9 August 2020
- journal article
- research article
- Published by Springer Nature in Cryptography and Communications
- Vol. 13 (1) , 27-52
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$IEEE Transactions on Information Theory, 2009
- Cyclic Codes Over $\mathbb{Z}_{4}$ of Even LengthDesigns, Codes and Cryptography, 2006
- Cyclic and Negacyclic Codes Over Finite Chain RingsIEEE Transactions on Information Theory, 2004
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/IEEE Transactions on Information Theory, 2003
- Weight distributions of cyclic self-dual codesIEEE Transactions on Information Theory, 2003
- Cyclic codes over Z4 of oddly even lengthDiscrete Applied Mathematics, 2003
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic codeIEEE Transactions on Information Theory, 1997
- A linear construction for certain Kerdock and Preparata codesBulletin of the American Mathematical Society, 1993
- Kerdock code in a cyclic formDiscrete Mathematics and Applications, 1991
- Semisimple cyclic and Abelian codes. IICybernetics and Systems Analysis, 1970