Linear codes over {\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}

In this work, we investigate linear codes over the ring ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ . We first analyze the structure of the ring and then define linear codes over this ring which turns out to be a ring that is not finite chain or principal ideal contrary to the rings that have hitherto been studied in coding theory. Lee weights and Gray maps for these codes are defined by extending on those introduced in works such as Betsumiya et al. (Discret Math 275:43–65, 2004) and Dougherty et al. (IEEE Trans Inf 45:32–45, 1999). We then characterize the ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linearity of binary codes under the Gray map and give a main class of binary codes as an example of ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes. The duals and the complete weight enumerators for ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes are also defined after which MacWilliams-like identities for complete and Lee weight enumerators as well as for the ideal decompositions of linear codes over ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ are obtained.     

On codes over $$\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}$$

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring \(R=\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\), where \(v^{3}=v\), for q odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over R. Further, we give bounds on the minimum distance of LCD codes over \(\mathbb {F}_q\) and extend these to codes over R.     

Some results on linear codes over the ring $$\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4$$

In this paper, we mainly study the theory of linear codes over the ring \(R =\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4\). By using the Chinese Remainder Theorem, we prove that R is isomorphic to a direct sum of four rings. We define a Gray map \(\Phi \) from \(R^{n}\) to \(\mathbb {Z}_4^{4n}\), which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over \(\mathbb {Z}_4\). We also discuss some properties of MDS codes over R. Furthermore, we study the MacWilliams identities of linear codes over R and give the generator polynomials of cyclic codes over R.     

Cyclic codes over $${{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}$$

In this work, we focus on cyclic codes over the ring \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} , which is not a finite chain ring. We use ideas from group rings and works of AbuAlrub et.al. in (Des Codes Crypt 42:273–287, 2007) to characterize the ring (\mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂)/(xⁿ-1){({{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2})/(x^n-1)} and cyclic codes of odd length. Some good binary codes are obtained as the images of cyclic codes over \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} under two Gray maps that are defined. We also characterize the binary images of cyclic codes over \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} in general.     

A characterization of $$\mathbb {Z}_{2}\mathbb {Z}_{2}[u]$$-linear codes

We prove that the class of \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear codes is exactly the class of \(\mathbb {Z}_2\)-linear codes with automorphism group of even order. Using this characterization, we give examples of known codes, e.g. perfect codes, which have a nontrivial \(\mathbb {Z}_2\mathbb {Z}_2[u]\) structure. Moreover, we exhibit some examples of \(\mathbb {Z}_2\)-linear codes which are not \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear. Also, we state that the duality of \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear codes is the same as the duality of \(\mathbb {Z}_2\)-linear codes. Finally, we prove that the class of \(\mathbb {Z}_2\mathbb {Z}_4\)-linear codes which are also \(\mathbb {Z}_2\)-linear is strictly contained in the class of \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear codes.     

On some permutation binomials and trinomials over $$\mathbb {F}_{2^n}$$

In this work, we completely characterize (1) permutation binomials of the form \(x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb {F}_{2^n}[x], n = 2^st, a \in \mathbb {F}_{2^{2t}}^{*}\), and (2) permutation trinomials of the form \(x^{2^s+1}+x^{2^{s-1}+1}+\alpha x \in \mathbb {F}_{2^t}[x]\), where s, t are positive integers. The first result, which was our primary motivation, is a consequence of the second result. The second result may be of independent interest.     

Codes over \mathbb{F}_3 + u\mathbb{F}_3 and Improvements to the Bounds on Ternary Linear Codes

New ternary linear codeswith parameters [208, 8, 127], [150, 10, 85],[160, 10, 91], [170, 10, 97], [180,10, 103], and [190, 10, 110], are found whichimprove the known lower bound on the maximum possible minimumHamming distance. These codes are constructed from codes over via a Gray map.     

Self-dual codes over \mathbb{Z}_8 and \mathbb{Z}_9

We study self-dual codes over the rings and . We define various weights and weight enumerators over these rings and describe the groups of invariants for each weight enumerator over the rings. We examine the torsion codes over these rings to describe the structure of self-dual codes. Finally we classify self-dual codes of small lengths over .     

On some constacyclic codes over $$\mathbb {Z}_{4}\left[ u\right] /\left\langle u^{2}-1\right\rangle $$, their $$\mathbb {Z}_4$$Z4 images,and new codes

In this paper, we study \(\lambda \)-constacyclic codes over the ring \(R=\mathbb {Z}_4+u\mathbb {Z}_4\) where \(u^{2}=1\), for \(\lambda =3+2u\) and \(2+3u\). Two new Gray maps from R to \(\mathbb {Z}_4^{3}\) are defined with the goal of obtaining new linear codes over \(\mathbb {Z}_4\). The Gray images of \(\lambda \)-constacyclic codes over R are determined. We then conducted a computer search and obtained many \(\lambda \)-constacyclic codes over R whose \(\mathbb {Z}_4\)-images have better parameters than currently best-known linear codes over \(\mathbb {Z}_4\).     

$${\mathbb{Z}_2\mathbb{Z}_4}$$-linear codes: rank and kernel

A code C{{\mathcal C}} is \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C{{\mathcal C}} by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary linear code). The corresponding binary codes of \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-additive codes under an extended Gray map are called \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes. In this paper, the invariants for \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the rank and dimension of the kernel, are studied. Specifically, given the algebraic parameters of \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the possible values of these two invariants, giving lower and upper bounds, are established. For each possible rank r between these bounds, the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with rank r is given. Equivalently, for each possible dimension of the kernel k, the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with dimension of the kernel k is given. Finally, the bounds on the rank, once the kernel dimension is fixed, are established and the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code for each possible pair (r, k) is given.     

\mathbb{Z }_2\mathbb{Z }_4-Additive formally self-dual codes

We study odd and even \(\mathbb{Z }_2\mathbb{Z }_4\) formally self-dual codes. The images of these codes are binary codes whose weight enumerators are that of a formally self-dual code but may not be linear. Three constructions are given for formally self-dual codes and existence theorems are given for codes of each type defined in the paper.     

Maximum distance separable codes over {\mathbb{Z}_4} and {\mathbb{Z}_2 \times \mathbb{Z}_4}

Known upper bounds on the minimum distance of codes over rings are applied to the case of ${\mathbb Z_{2}\mathbb Z_{4}}$ -additive codes, that is subgroups of ${\mathbb Z_{2}^{\alpha}\mathbb Z_{4}^{\beta}}$ . Two kinds of maximum distance separable codes are studied. We determine all possible parameters of these codes and characterize the codes in certain cases. The main results are also valid when ?? = 0, namely for quaternary linear codes.     

Nonexistence of generalized bent functions from $$\mathbb {Z}_{2}^{n}$$ to $$\mathbb {Z}_{m}$$Zm

In this paper, several nonexistence results on generalized bent functions \(f:\mathbb {Z}_{2}^{n} \rightarrow \mathbb {Z}_{m}\) are presented by using the knowledge on cyclotomic number fields and their imaginary quadratic subfields.     

Isometric embeddings of \mathbb{Z}_{p^k} in the Hamming space \mathbb{F}_{p}^{N} and \mathbb{Z}_{p^k}-linear codes

Isometric embeddings of $\mathbb{Z}_{p^n+1}$ into the Hamming space ( $\mathbb{F}_{p}^{p^n},w$ ) have played a fundamental role in recent constructions of non-linear codes. The codes thus obtained are very good codes, but their rate is limited by the rate of the first-order generalized Reed–Muller code—hence, when n is not very small, these embeddings lead to the construction of low-rate codes. A natural question is whether there are embeddings with higher rates than the known ones. In this paper, we provide a partial answer to this question by establishing a lower bound on the order of a symmetry of ( $\mathbb{F}_{p}^{N},w$ ).     

Additive properties of product sets in the field $$ \mathbb{F}_{p^2 } $$

For given positive integer n and ε > 0 we consider an arbitrary nonempty subset A of a field consisting of p ² elements such that its cardinality exceeds p ^2/n?ε . We study the possibility to represent an arbitrary element of the field as a sum of at most N(n, ε) elements from the nth degree of the set A. An upper estimate for the number N(n, ε) is obtained when it is possible.     

On two-weight $$\mathbb {Z}_{2^k}$$-codes

We determine the possible homogeneous weights of regular projective two-weight codes over \(\mathbb {Z}_{2^k}\) of length \(n>3\), with dual Krotov distance \(d^{\lozenge }\) at least four. The determination of the weights is based on parameter restrictions for strongly regular graphs applied to the coset graph of the dual code. When \(k=2\), we characterize the parameters of such codes as those of the inverse Gray images of \(\mathbb {Z}_4\)-linear Hadamard codes, which have been characterized by their types by several authors.     

Elliptic near-MDS codes over $${\mathbb{F}}_5$$

Let Γ₆ be the elliptic curve of degree 6 in PG(5, q) arising from a non-singular cubic curve of PG(2, q) via the canonical Veronese embedding

A new family of differentially 4-uniform permutations over $$\mathbb{F}_{2^{2k} }$$ for odd k

We study the differential uniformity of a class of permutations over \(\mathbb{F}_{2^n } \) with n even. These permutations are different from the inverse function as the values x^?1 are modified to be (γx)^? on some cosets of a fixed subgroup 〈γ〉 of \(\mathbb{F}_{2^n }^* \). We obtain some sufficient conditions for this kind of permutations to be differentially 4-uniform, which enable us to construct a new family of differentially 4-uniform permutations that contains many new Carlet-Charpin-Zinoviev equivalent (CCZ-equivalent) classes as checked by Magma for small numbers n. Moreover, all of the newly constructed functions are proved to possess optimal algebraic degree and relatively high nonlinearity.