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.     

Cyclic DNA codes over the ring $$\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2$$

We study the structure of cyclic DNA codes of odd length over the finite commutative ring \(R=\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2 + v^2\mathbb {F}_2+uv^2\mathbb {F}_2,~u^2=0, v^3=v\), which plays an important role in genetics, bioengineering and DNA computing. A direct link between the elements of the ring R and 64 codons used in the amino acids of living organisms is established by introducing a Gray map from R to \(R_1=\mathbb {F}_2+u\mathbb {F}_2 ~(u^2=0)\). The reversible and the reversible-complement codes over R are investigated. We also discuss the binary image of the cyclic DNA codes over R. Among others, some examples of DNA codes obtained via Gray map are provided.     

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 the distribution of the residues of small multiplicative subgroups of $$ \mathbb{F}_p $$

Distributional properties of small multiplicative subgroups of are obtained. In particular, it is shown that if H < is of size larger than polylogarithmic in p, then, letting β < 1 be a fixed exponent, most elements of any coset aH (a ∈ , arbitrary) will not fall into the interval [−p ^β, p ^β] ∈ . The arguments are based on the theory of heights and results from additive combinatoric.     

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.     

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.     

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.     

Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in $${\mathbb{P}^{4}(\mathbb{F}_q)}$$

We study the functional codes of second order on a non-degenerate Hermitian variety as defined by G. Lachaud. We provide the best possible bounds for the number of points of quadratic sections of . We list the first five weights, describe the corresponding codewords and compute their number. The paper ends with two conjectures. The first is about minimum distance of the functional codes of order h on a non-singular Hermitian variety . The second is about distribution of the codewords of first five weights of the functional codes of second order on a non-singular Hermitian variety .      

Surfaces in $$\mathbb {R}^7$$ obtained from harmonic maps in $$S^6$$S6.

We will investigate the local geometry of the surfaces in the 7-dimensional Euclidean space associated to harmonic maps from a Riemann surface \(\varSigma \) into \(S^6\). By applying methods based on the use of harmonic sequences, we will characterize the conformal harmonic immersions \(\varphi :\varSigma \rightarrow S^6\) whose associated immersions \(F:\varSigma \rightarrow \mathbb {R}^7\) belong to certain remarkable classes of surfaces, namely: minimal surfaces in hyperspheres; surfaces with parallel mean curvature vector field; pseudo-umbilical surfaces; isotropic surfaces.     

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.     

On Hamiltonian Minimality of Isotropic Nonhomogeneous Tori in $$\mathbb{H}^n$$ and $$\mathbb{C} \mathrm{P}^{2n+1}$$

Mathematical Notes - We construct a family of flat isotropic nonhomogeneous tori in $$\mathbb{H}^n$$ and $$\mathbb{C}\mathrm{P}^{2n+1}$$ and find necessary and sufficient conditions for their...     

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.     

Markov subshifts and partial representation of $$\mathbb{F}_{\text n}$$

In this paper we fix a set * of positive elements of the free group (e. g. the set of finite words occurring in a Markov subshift) as well as n partial isometries on a Hilbert space H. Based on these we define a map S : which we prove to be a partial representation of on H under certain conditions studied by Matsumoto.*Supported by Capes.     

Strong Central Limit Theorem for isotropic random walks in {\mathbb{R}^d}

We prove an optimal Gaussian upper bound for the densities of isotropic random walks on ${\mathbb{R}^d}$ in spherical case (d ?? 2) and ball case (d ?? 1). We deduce the strongest possible version of the Central Limit Theorem for the isotropic random walks: if ${\tilde S_n}$ denotes the normalized random walk and Y the limiting Gaussian vector, then ${\mathbb{E} f(\tilde S_{n}) \rightarrow \mathbb{E} f(Y)}$ for all functions f integrable with respect to the law of Y. We call such result a ??Strong CLT??. We apply our results to get strong hypercontractivity inequalities and strong Log-Sobolev inequalities.     

$M_{2}({\mathbb F})$上的$H$-模代数结构

设${\mathbb F}$是特征为零的代数闭域, $H$为非点化非幺模的8维非半单Hopf代数, $M_{2}({\mathbb F})$为${\mathbb F}$上二阶方阵组成的全矩阵代数. 本文的主要目的是讨论和分类$M_{2}({\mathbb F})$上所有的$H$-模代数结构.     

Linear codes over $$\mathbb {F}_{q}[x]/(x^2)$$ and $$GR(p^2,m)$$GR(p2,m) reaching the Griesmer bound

We construct two series of linear codes C(G) over \(\mathbb {F}_{q}[x]/(x^2)\) and \(GR(p^2,m)\) reaching the Griesmer bound. Moreover, we consider the Gray images of C(G). The results show that the Gray images of C(G) over \(\mathbb {F}_{q}[x]/(x^2)\) are linear and also reach the Griesmer bound in some cases, and many of linear codes over \(\mathbb {F}_{q}\) we constructed have two Hamming (non-zero) weights.     

On Hamiltonian-Minimal Lagrangian Tori in $$\mathbb{C}P^2 $$

We obtain some equations for Hamiltonian-minimal Lagrangian surfaces in CP ² and give their particular solutions in the case of tori.     

$${\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.