Construction and enumeration of left dihedral codes satisfying certain duality properties

Let ${\mathbb{F}}_q$ be the finite field of q elements and let $D_{2n}=〈x,y|x^n=1,y^2=1,yxy=x^{n?1}〉$ be the dihedral group of 2n elements. Left ideals of the group algebra ${\mathbb{F}}_q[D_{2n}]$ are known as left dihedral codes over ${\mathbb{F}}_q$ of length 2n, and abbreviated as left $D_{2n}$-codes. Let $\gcd (n,q)=1$. In this paper, we give an explicit representation for the Euclidean hull of every left $D_{2n}$-code over ${\mathbb{F}}_q$. On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left $D_{2n}$-codes over ${\mathbb{F}}_q$. In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left $D_{2n}$-codes and self-dual left $D_{2n}$-codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left $D_{2n}$-code over ${\mathbb{F}}_q$, and present several numerical examples to illustrative our applications.     

Linearity and classification of ZpZp2-linear generalized Hadamard codes

The ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-additive codes are subgroups of ${\mathbb{Z}}_p^{{\alpha }_1}\times {\mathbb{Z}}_{p^2}^{{\alpha }_2}$, and can be seen as linear codes over ${\mathbb{Z}}_p$ when ${\alpha }_2=0$, ${\mathbb{Z}}_{p^2}$-additive codes when ${\alpha }_1=0$, or ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive codes when $p=2$. A ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear generalized Hadamard (GH) code is a GH code over ${\mathbb{Z}}_p$ which is the Gray map image of a ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-additive code. Recursive constructions of ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-additive GH codes of type $({\alpha }_1,{\alpha }_2;t_1,t_2)$ with $t_1,t_2\ge 1$ are known. In this paper, we generalize some known results for ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes with $p=2$ to any $p\ge 3$ prime when ${\alpha }_1\ne 0$, and then we compare them with the ones obtained when ${\alpha }_1=0$. First, we show for which types the corresponding ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes are nonlinear over ${\mathbb{Z}}_p$. Then, for these codes, we compute the kernel and its dimension, which allow us to classify them completely. Moreover, by computing the rank of some of these codes, we show that, unlike ${\mathbb{Z}}_4$-linear Hadamard codes, the ${\mathbb{Z}}_{p^2}$-linear GH codes are not included in the family of ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes with ${\alpha }_1\ne 0$ when $p\ge 3$ prime. Indeed, there are some families with infinite nonlinear ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes, where the codes are not equivalent to any ${\mathbb{Z}}_{p^s}$-linear GH code with $s\ge 2$.     

Generalized almost perfect nonlinear binomials and trinomials over fields of prime-square order

Let $p>3$ be a prime. We show that, for each integer d with $p\le d\le 2(p-1)$, there exists a generalized almost perfect nonlinear (GAPN) binomial or trinomial over ${\mathbb{F}}_{p^2}$ of algebraic degree d. We start by deriving sufficient conditions for the function $G:{\mathbb{F}}_{p^2}\to {\mathbb{F}}_{p^2},X\mapsto X^{d_1}+u{X}^{d_2}$ to be GAPN in the case where one of the terms of G is GAPN. We then give explicit constructions of GAPN binomials over ${\mathbb{F}}_{p^2}$ of any odd algebraic degree between p and $2(p-1)$ and, in the case where p is not a Mersenne prime, also of any even algebraic degree in this range. To obtain GAPN functions of even algebraic degree also in the general case, we finally show how to construct GAPN trinomials over ${\mathbb{F}}_{p^2}$ of any even algebraic degree between p and $2(p-1)$ by applying a characterization of a special form of GAPN binomials by Özbudak and Sălăgean. Our constructed functions are the first GAPN functions of even algebraic degree over extension fields of odd characteristic reported so far.     

Classification of cyclic codes over a non-Galois chain ring Zp[u]/〈u3〉

We explicitly determine generators of cyclic codes over a non-Galois finite chain ring ${\mathbb{Z}}_p[u]/〈u^3〉$ of length $p^k$, where p is a prime number and k is a positive integer. We completely classify that there are three types of principal ideals of ${\mathbb{Z}}_p[u]/〈u^3〉$ and four types of non-principal ideals of ${\mathbb{Z}}_p[u]/〈u^3〉$, which are associated with cyclic codes over ${\mathbb{Z}}_p[u]/〈u^3〉$ of length $p^k$. We then obtain a mass formula for cyclic codes over ${\mathbb{Z}}_p[u]/〈u^3〉$ of length $p^k$.     

The dual code of any (δ+αu2)-constacyclic code over F2m[u]∕〈u4〉 of oddly even length

Let ${\mathbb{F}}_{2^m}$ be a finite field of cardinality $2^m$, $R={\mathbb{F}}_{2^m}\left[u\right]∕〈u^4〉={\mathbb{F}}_{2^m}+u{\mathbb{F}}_{2^m}+u^2{\mathbb{F}}_{2^m}+u^3{\mathbb{F}}_{2^m}$ $(u^4=0)$ which is a finite chain ring, and $n$ is an odd positive integer. For any $\delta ,\alpha \in {\mathbb{F}}_{2^m}^{\times }$, an explicit representation for the dual code of any $(\delta +\alpha u^2)$-constacyclic code over $R$ of length $2n$ is given. And some dual codes of $(1+u^2)$-constacyclic codes over $R$ of length 14 are constructed. For the case of $\delta =1$, all distinct self-dual $(1+\alpha u^2)$-constacyclic codes over $R$ of length $2n$ are determined.     

Non-integrated defect relation for meromorphic mappings on Kähler manifolds intersecting non-subdegenerate families of hyperplanes

Let M be a complete Kähler manifold, whose universal covering is biholomorphic to a ball ${\mathbb{B}}^m(R_0)$ in ${\mathbb{C}}^m$ ($0<R_0\le +\infty$). Our purpose of this article is to establish a non-integrated defect relation with truncated level for a meromorphic mapping on M intersecting a family of hyperplanes in ${\mathbb{P}}^n(\mathbb{C})$ which is non-subdegenerate with respect to the mapping.     

Construction of extremal Type II Z2k-codes

We give methods for constructing many self-dual ${\mathbb{Z}}_m$-codes and Type II ${\mathbb{Z}}_{2k}$-codes of length 2n starting from a given self-dual ${\mathbb{Z}}_m$-code and Type II ${\mathbb{Z}}_{2k}$-code of length 2n, respectively. As an application, we construct extremal Type II ${\mathbb{Z}}_{2k}$-codes of length 24 for $k=4,5,\dots ,20$ and extremal Type II ${\mathbb{Z}}_{2k}$-codes of length 32 for $k=4,5,\dots ,10$. We also construct new extremal Type II ${\mathbb{Z}}_4$-codes of lengths 56 and 64.     

Equivalences among Z2s-linear Hadamard codes

The ${\mathbb{Z}}_{2^s}$-additive codes are subgroups of ${\mathbb{Z}}_{2^s}^n$, and can be seen as a generalization of linear codes over ${\mathbb{Z}}_2$ and ${\mathbb{Z}}_4$. A ${\mathbb{Z}}_{2^s}$-linear Hadamard code is a binary Hadamard code which is the Gray map image of a ${\mathbb{Z}}_{2^s}$-additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ are equivalent, once $t$ is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to $t=11$, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on $s\in \{2,3\}$, the full classification of the ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ is established by giving the exact number of such codes.     

Permutation binomials of the form xr(xq−1 + a) over Fqe

We present several existence and nonexistence results for permutation binomials of the form $x^r(x^{q-1}+a)$, where $e\ge 2$ and $a\in {\mathbb{F}}_{q^e}^{⁎}$. As a consequence, we obtain a complete characterization of such permutation binomials over ${\mathbb{F}}_{q^2}$, ${\mathbb{F}}_{q^3}$, ${\mathbb{F}}_{q^4}$, ${\mathbb{F}}_{p^5}$, and ${\mathbb{F}}_{p^6}$, where p is an odd prime.     

Asymptotically good ZprZps-additive cyclic codes

We construct a class of ${\mathbb{Z}}_{p^r}{\mathbb{Z}}_{p^s}$-additive cyclic codes generated by pairs of polynomials, where p is a prime number. Based on probabilistic arguments, we determine the asymptotic rates and relative distances of this class of codes: the asymptotic Gilbert-Varshamov bound at $\frac{1+p^{s-r}}{2}\delta$ is greater than $\frac{1}{2}$ and the relative distance of the code is convergent to δ, while the rate is convergent to $\frac{1}{1+p^{s-r}}$ for $0<\delta <\frac{1}{1+p^{s-r}}$ and $1\le r<s$. As a consequence, we prove that there exist numerous asymptotically good ${\mathbb{Z}}_{p^r}{\mathbb{Z}}_{p^s}$-additive cyclic codes.     

Maximality of Ciani curves over finite fields

In this paper, we will study Ciani curves in characteristic $p\ge 3$, in particular their standard forms $C:x^4+y^4+z^4+r{x}^2{y}^2+s{y}^2{z}^2+t{z}^2{x}^2=0$. It is well-known that any Ciani curve is a non-hyperelliptic curve of genus 3, and its Jacobian variety is isogenous to the product of three elliptic curves. As a main result, we will show that if C is superspecial, then $r,s,t$ belong to ${\mathbb{F}}_{p^2}$ and C is maximal or minimal over ${\mathbb{F}}_{p^2}$. Moreover, in this case we will provide a simple criterion in terms of $r,s,t,p$ that tells whether C is maximal (resp. minimal) over ${\mathbb{F}}_{p^2}$.     

On the existence of primitive completely normal bases of finite fields

Let ${\mathbb{F}}_q$ be the finite field of characteristic p with q elements and ${\mathbb{F}}_{q^n}$ its extension of degree n. We prove that there exists a primitive element of ${\mathbb{F}}_{q^n}$ that produces a completely normal basis of ${\mathbb{F}}_{q^n}$ over ${\mathbb{F}}_q$, provided that $n=p^{?}m$ with $(m,p)=1$ and $q>m$.