A note on the dual codes of module skew codes

Delphine Boucher (1) , Félix Ulmer (1)

1 IRMAR - Institut de Recherche Mathématique de Rennes

In [4], starting from an automorphism theta of a finite field F_q and a skew polynomial ring R=F_q[X;theta], module theta-codes are defined as left R-submodules of R/Rf where f in R. In [4] it is conjectured that an Euclidean self-dual module theta-code is a theta-constacyclic code and a proof is given in the special case when the order of theta divides the length of the code. In this paper we prove that this conjecture holds in general by showing that the dual of a module theta-code is a module theta-code if and only if it is a theta-constacyclic code. Furthermore, we establish that a module theta-code which is not theta-constacyclic is a shortened theta-constacyclic code and that its dual is a punctured theta-constacyclic code. This enables us to give the general form of a parity-check matrix for module theta-codes and for module (theta,delta)-codes over F_q[X;theta,delta] where delta is a derivation over F_q . We also prove the conjecture for module theta-codes who are defined over a ring A[X;theta] where A is a finite ring. Lastly we construct self-dual theta-cyclic codes of length 2^s over F_4 for s ≥ 3 which are asymptotically bad and conjecture that there exists no other self-dual module theta-code of this length over F_4.

Mots clés: error-correcting codes; finite fields; skew polynomial rings

Domaines: Théorie de l'information et codage [math.IT]; Théorie de l'information [cs.IT]

Delphine Boucher, Félix Ulmer. A note on the dual codes of module skew codes. Liqun Chen. Cryptography and coding: 13th IMA international conference, IMACC 2011, Oxford, UK, December 12-15, 2011 : proceedings, Springer, pp.230-243, 2011, Lecture Notes in Computer Science, vol. 7089, 978-3-642-25515-1. ⟨10.1007/978-3-642-25516-8_14⟩. ⟨hal-00602796v2⟩