Dual codes of product semi-linear codes

Abstract

Let Fq be a finite field with q elements and denote by θ : Fqq an automorphism of Fq. In this paper, we deal with linear codes of Fqn invariant under a semi-linear map T:Fqnqn for some n≥ 2. In particular, we study three kind of their dual codes, some relations between them and we focus on codes which are products of module skew codes in the non-commutative polynomial ring Fq[X,θ] as a subcase of linear codes invariant by a semi-linear map T. In this setting we give also an algorithm for encoding, decoding and detecting errors and we show a method to construct codes invariant under a fixed T.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…