Difference Sets in {\mathbb{Z}}_4^m and {\mathbb{F}}_2^{2m}

Let R=GR(4,m) be the Galois ring of cardinality 4^m and let T be the Teichmüller system of R. For every map λ of T into { -1,+1} and for every permutation Π of T, we define a map φ _λ ^Π of Rinto { -1,+1} as follows: if x∈R and if x=a+2b is the 2-adic representation of x with x∈T and b∈T, then φ _λ ^Π (x)=λ(a)+2Tr(Π(a)b), where Tr is the trace function of R . For i=1 or i=-1, define D _i as the set of x in R such thatφ _λ ^Π =i. We prove the following results: 1) D _i is a Hadamard difference set of (R,+). 2) If φ is the Gray map of R into ${\mathbb{F}}_2^{2m}$ , then (D _i) is a difference set of ${\mathbb{F}}_2^{2m}$ . 3) The set of D _i and the set of φ(D _i) obtained for all maps λ and Π, both are one-to-one image of the set of binary Maiorana-McFarland difference sets in a simple way. We also prove that special multiplicative subgroups of R are difference sets of kind D _i in the additive group of R. Examples are given by means of morphisms and norm in R.     

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.     

Burgess Inequality In {\mathbb {F}_{p^2}}

The purpose of the paper is to present new estimates on incomplete character sums in finite fields that are of the strength of Burgess’ celebrated theorem for prime fields. More precisely, an inequality of this type is obtained in F_p²{F_{p^2}} and also for binary quadratic forms, improving on the work of Davenport–Lewis and on several results due to Burgess. The arguments are based on new estimates for the multiplicative energy of certain sets that allow us to improve the amplification step in Burgess’ method.     

A Difference Set in \left( {\mathbb{Z}/4\mathbb{Z}} \right)^3 \times \mathbb{Z}/5\mathbb{Z}

We present a (320, 88, 24)-difference set in , the existence of which was previously open. This new difference set improves a theorem of Davis-Jedwab with the removal of the exceptional case. It also enables us to state a theorem of Schmidt on Davis-Jedwab difference sets more neatly.     

On Quadratic Differentials and Twisted Normal Maps of Surfaces in {\mathbb{S}^{2} \times\mathbb{R}} and {\mathbb{H}^{2} \times\mathbb{R}}

Given a Lie group G with a bi-invariant metric and a compact Lie subgroup K, Bittencourt and Ripoll used the homogeneous structure of quotient spaces to define a Gauss map ${\mathcal{N}:M^{n}\rightarrow{\mathbb{S}}}$ on any hypersupersurface ${M^{n}\looparrowright G/K}$ , where ${{\mathbb{S}}}$ is the unit sphere of the Lie algebra of G. It is proved in Bittencourt and Ripoll (Pacific J Math 224:45–64, 2006) that M ⁿ having constant mean curvature (CMC) is equivalent to ${\mathcal{N}}$ being harmonic, a generalization of a Ruh–Vilms theorem for submanifolds in the Euclidean space. In particular, when n = 2, the induced quadratic differential ${\mathcal{Q}_{\mathcal{N}}:=(\mathcal{N}^{\ast}g)^{2,0}}$ is holomorphic on CMC surfaces of G/K. In this paper, we take ${G/K={\mathbb{S}}^{2}\times{\mathbb{R}}}$ and compare ${\mathcal{Q}_{\mathcal{N}}}$ with the Abresch–Rosenberg differential ${\mathcal{Q}}$ , also holomorphic for CMC surfaces. It is proved that ${\mathcal{Q}=\mathcal{Q}_{\mathcal{N}}}$ , after showing that ${\mathcal{N}}$ is the twisted normal given by (1.5) herein. Then we define the twisted normal for surfaces in ${{\mathbb{H}}^{2}\times{\mathbb{R}}}$ and prove that ${\mathcal{Q}=\mathcal{Q}_{\mathcal{N}}}$ as well. Within the unified model for the two product spaces, we compute the tension field of ${\mathcal{N}}$ and extend to surfaces in ${{\mathbb{H}}^{2}\times{\mathbb{R}}}$ the equivalence between the CMC property and the harmonicity of ${\mathcal{N}.}$      

Isometric Immersions into {\mathbb{S}^m \times \mathbb{R}} and {\mathbb{H}^m \times \mathbb{R}} with High Codimensions

In this paper, we obtain sufficient and necessary conditions for a simply connected Riemannian manifold (M ⁿ , g) to be isometrically immersed into ${\mathbb{S}^m \times \mathbb{R}}$ and ${\mathbb{H}^m \times \mathbb{R}}$ .     

Classification of rotational special Weingarten surfaces of minimal type in {\mathbb{S}^2 \times \mathbb{R}} and {\mathbb{H}^2 \times \mathbb{R}}

In this paper we classify the complete rotational special Weingarten surfaces in ${\mathbb{S}^2 \times \mathbb{R}}$ and ${\mathbb{H}^2 \times \mathbb{R}}$ ; i.e. rotational surfaces in ${\mathbb{S}^2 \times \mathbb{R}}$ and ${\mathbb{H}^2 \times \mathbb{R}}$ whose mean curvature H and extrinsic curvature K _e satisfy H = f(H ² ? K _e ), for some function ${f \in \mathcal{C}^1([0,+\infty))}$ such that f(0) = 0 and 4x(f′(x))² < 1 for any x ≥ 0. Furthermore we show the existence of non-complete examples of such surfaces.     

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

Proving properties of matrices over {\mathbb{Z}_{2}}

We prove assorted properties of matrices over ${\mathbb{Z}_{2}}$ , and outline the complexity of the concepts required to prove these properties. The goal of this line of research is to establish the proof complexity of matrix algebra. It also presents a different approach to linear algebra: one that is formal, consisting in algebraic manipulations according to the axioms of a ring, rather than the traditional semantic approach via linear transformations.     

On MDS convolutional codes over $${\mathbb {Z}}_{p^{r}}$$

Maximum distance separable (MDS) convolutional codes are characterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over \({\mathbb {Z}}_{p^{r}}\) was recently discovered in Oued and Sole (IEEE Trans Inf Theory 59(11):7305–7313, 2013) via the Hensel lift of a cyclic code. In this paper we further investigate this important class of convolutional codes over \({\mathbb {Z}}_{p^{r}}\) from a new perspective. We introduce the notions of p-standard form and r-optimal parameters to derive a novel upper bound of Singleton type on the free distance. Moreover, we present a constructive method for building general (non necessarily free) MDS convolutional codes over \({\mathbb {Z}}_{p^{r}}\) for any given set of parameters.     

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

Convergence of polyharmonic splines on semi-regular grids \mathbb{Z}{{\boldsymbol{\times}} \boldsymbol{a}} {\mathbb{Z}^{\it\boldsymbol{n}}} for {\boldsymbol{a}\rightarrow\mathbf {0}}

Let p, n ∈ ? with 2p ≥ n + 2, and let I _a be a polyharmonic spline of order p on the grid ? × a? ⁿ which satisfies the interpolating conditions $I_{a}\left( j,am\right) =d_{j}\left( am\right) $ for j ∈ ?, m ∈ ? ⁿ where the functions d _j : ? ⁿ → ? and the parameter a > 0 are given. Let $B_{s}\left( \mathbb{R}^{n}\right) $ be the set of all integrable functions f : ? ⁿ → ? such that the integral $$ \left\| f\right\| _{s}:=\int_{\mathbb{R}^{n}}\left| \widehat{f}\left( \xi\right) \right| \left( 1+\left| \xi\right| ^{s}\right) d\xi $$ is finite. The main result states that for given $\mathbb{\sigma}\geq0$ there exists a constant c>0 such that whenever $d_{j}\in B_{2p}\left( \mathbb{R}^{n}\right) \cap C\left( \mathbb{R}^{n}\right) ,$ j ∈ ?, satisfy $\left\| d_{j}\right\| _{2p}\leq D\cdot\left( 1+\left| j\right| ^{\mathbb{\sigma}}\right) $ for all j ∈ ? there exists a polyspline S : ? ⁿ⁺¹ → ? of order p on strips such that $$ \left| S\left( t,y\right) -I_{a}\left( t,y\right) \right| \leq a^{2p-1}c\cdot D\cdot\left( 1+\left| t\right| ^{\mathbb{\sigma}}\right) $$ for all y ∈ ? ⁿ , t ∈ ? and all 0 < a ≤ 1.     

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.     

The invariants of modular indecomposable representations of {{\mathbb Z}_{p^2}}

We consider the invariant ring for an indecomposable representation of a cyclic group of order p ² over a field of characteristic p. We describe a set of -algebra generators of this ring of invariants, and thus derive an upper bound for the largest degree of an element in a minimal generating set for the ring of invariants. This bound, as a polynomial in p, is of degree two.     

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.     

There is exactly one $${\mathbb {Z}}_2{\mathbb {Z}}_4$$-cyclic 1-perfect code

Let \(\mathcal{C}\) be a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-additive code of length \(n > 3\). We prove that if the binary Gray image of \(\mathcal{C}\) is a 1-perfect nonlinear code, then \(\mathcal{C}\) cannot be a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-cyclic code except for one case of length \(n=15\). Moreover, we give a parity check matrix for this cyclic code. Adding an even parity check coordinate to a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-additive 1-perfect code gives a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-additive extended 1-perfect code. We also prove that such a code cannot be \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-cyclic.