Modular and p-adic cyclic codes
Designs, Codes and Cryptography
Cyclic Codes Over$$\mathbb{Z}_{4}$$ of Even Length
Designs, Codes and Cryptography
Repeated-root cyclic and negacyclic codes over a finite chain ring
Discrete Applied Mathematics - Special issue: Coding and cryptography
MDS codes over finite principal ideal rings
Designs, Codes and Cryptography
Negacyclic MDS codes over GR(2a,m)
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Constructions of self-dual codes over finite commutative chain rings
International Journal of Information and Coding Theory
Negacyclic and cyclic codes over Z4
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the Hamming distance of linear codes over a finite chain ring
IEEE Transactions on Information Theory
Negacyclic codes over Z4 of even length
IEEE Transactions on Information Theory
Cyclic and negacyclic codes over finite chain rings
IEEE Transactions on Information Theory
Negacyclic codes of length 2s over galois rings
IEEE Transactions on Information Theory
Complete Distances of All Negacyclic Codes of Length 2s Over Z2a
IEEE Transactions on Information Theory
Cyclic Codes over the Integers Modulopm
Finite Fields and Their Applications
| Hi-index | 0.00 |
In this article, we study negacyclic self-dual codes of length n over a finite chain ring R when the characteristic p of the residue field $${\bar{R}}$$ and the length n are relatively prime. We give necessary and sufficient conditions for the existence of (nontrivial) negacyclic self-dual codes over a finite chain ring. As an application, we construct negacyclic MDR self-dual codes over GR(p t , m) of length p m + 1.