A note on isodual constacyclic codes

This note gives a counterexample of Theorem 20 in the paper of Blackford (2013) [2]. The counterexample shows that [2, Theorem 20] is incorrect. Furthermore, we provide corrections to the above result.

[1]  H. Q. Dinh,et al.  Negacyclic codes of length 2/sup s/ over galois rings , 2005, IEEE Transactions on Information Theory.

[2]  Sergio R. López-Permouth,et al.  Cyclic and negacyclic codes over finite chain rings , 2004, IEEE Transactions on Information Theory.

[3]  Thomas Blackford.  Isodual constacyclic codes , 2013, Finite Fields Their Appl..

[4]  Thomas Blackford.  Negacyclic duadic codes , 2008, Finite Fields Their Appl..

[5]  H. Dinh.  Constacyclic Codes of Length p^s Over Fpm + uFpm , 2010 .

[6]  Hai Q. Dinh,et al.  Repeated-root constacyclic codes of length 2ps , 2012, Finite Fields Their Appl..

[7]  Saroj Rani,et al.  On constacyclic codes over finite fields , 2015, Cryptography and Communications.

[8]  Hai Q. Dinh,et al.  Constacyclic codes of length 2p s over F p m +uF p m . , 2016 .