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.     

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.     

Decomposing triples of \mathbb{Z}_{p^n } and \mathbb{Z}_{3p^n } into cyclic designs

In this paper, we give some decompositions of triples of Zp^n or Z3p^n into cyclic triple systems. New constructions of difference families are given. Some infinite classes of simple cyclic triple systems are obtained from these decompositions.     

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.     

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$ ).     

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.     

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 .     

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.     

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

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.     

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.     

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.     

L'anneau\mathbb{Z} [\sqrt {14} ] et l'algorithme Euclidien

The aim of this note is to study the ring \(\mathbb{Z} [\sqrt {14} ]\) and in particular the question whether it is Euclidean or not. The following results are obtained:

1. The couples of elements of \(\mathbb{Z} [\sqrt {14} ]\) which are not Euclidean with respect to the absolute value of the norm are determined.
2. An Euclidean algorithm for \(\mathbb{Z} [\sqrt {14} ]\) is constructed under suitable assumptions (Hypothèse 4.1).

     

$$\mathbb {Z}_{4}$$-codes and their Gray map images as orthogonal arrays

A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over \(\mathbb {Z}_{4}\) and their (usually non-linear) binary Gray map images. We show that Delsarte’s observation extends to codes over arbitrary finite commutative rings with identity. Also, we show that the strength of the Gray map image of a \(\mathbb {Z}_{4}\) code is one less than the minimum Lee weight of its Gray map image.     

Hausdorff measures of subgroups of \mathbb{R }/\mathbb{Z } and \mathbb{R }

For a sequence $\underline{u}=(u_n)_{n\in \mathbb{N }}$ of integers, let $t_{\underline{u}}(\mathbb{T })$ be the group of all topologically $\underline{u}$ -torsion elements of the circle group $\mathbb{T }:=\mathbb{R }/\mathbb{Z }$ . We show that for any $s\in ]0,1[$ and $m\in \{0,+\infty \}$ there exists $\underline{u}$ such that $t_{\underline{u}}(\mathbb{T })$ has Hausdorff dimension $s$ and $s$ -dimensional Hausdorff measure equal to $m$ (no other values for $m$ are possible). More generally, for dimension functions $f,g$ with $f(t)\prec g(t), f(t)\prec \!\!\!\prec t$ and $g(t)\prec \!\!\!\prec t$ we find $\underline{u}$ such that $t_{\underline{u}}(\mathbb{T })$ has at the same time infinite $f$ -measure and null $g$ -measure.     

Constant Angle Property and Canonical Principal Directions for Surfaces in {\mathbb{M}^{2}(c) \times {\mathbb{R}_{1}}}

In this paper, we study surfaces in Lorentzian product spaces ${{\mathbb{M}^{2}(c) \times \mathbb{R}_1}}$ . We classify constant angle spacelike and timelike surfaces in ${{\mathbb{S}^{2} \times \mathbb{R}_1}}$ and ${{\mathbb{H}^{2} \times \mathbb{R}_1}}$ . Moreover, complete classifications of spacelike surfaces in ${{\mathbb{S}^{2} \times \mathbb{R}_1}}$ and ${{\mathbb{H}^{2} \times \mathbb{R}_1}}$ and timelike surfaces in ${{\mathbb{M}^{2}(c) \times \mathbb{R}_1}}$ with a canonical principal direction are obtained. Finally, a new characterization of the catenoid of the 3rd kind is established, as the only minimal timelike surface with a canonical principal direction in Minkowski 3–space.     

Uniqueness of \mathbb{C}^{ * } - and \mathbb{C}_{{\text{ + }}} -actions on Gizatullin Surfaces

A Gizatullin surface is a normal affine surface V over $ \mathbb{C} $ , which can be completed by a zigzag; that is, by a linear chain of smooth rational curves. In this paper we deal with the question of uniqueness of $ \mathbb{C}^{ * } $ -actions and $ \mathbb{A}^{{\text{1}}} $ -fibrations on such a surface V up to automorphisms. The latter fibrations are in one to one correspondence with $ \mathbb{C}_{{\text{ + }}} $ -actions on V considered up to a “speed change”. Non-Gizatullin surfaces are known to admit at most one $ \mathbb{A}^{1} $ -fibration V → S up to an isomorphism of the base S. Moreover, an effective $ \mathbb{C}^{ * } $ -action on them, if it does exist, is unique up to conjugation and inversion t $ \mapsto $ t ^?1 of $ \mathbb{C}^{ * } $ . Obviously, uniqueness of $ \mathbb{C}^{ * } $ -actions fails for affine toric surfaces. There is a further interesting family of nontoric Gizatullin surfaces, called the Danilov-Gizatullin surfaces, where there are in general several conjugacy classes of $ \mathbb{C}^{ * } $ -actions and $ \mathbb{A}^{{\text{1}}} $ -fibrations, see, e.g., [FKZ1]. In the present paper we obtain a criterion as to when $ \mathbb{A}^{{\text{1}}} $ -fibrations of Gizatullin surfaces are conjugate up to an automorphism of V and the base $ S \cong \mathbb{A}^{{\text{1}}} $ . We exhibit as well large subclasses of Gizatullin $ \mathbb{C}^{ * } $ -surfaces for which a $ \mathbb{C}^{ * } $ -action is essentially unique and for which there are at most two conjugacy classes of $ \mathbb{A}^{{\text{1}}} $ -fibrations over $ \mathbb{A}^{{\text{1}}} $ .     

Computing Cup Products in \mathbb {Z}_2-Cohomology of 3D Polyhedral Complexes

Let \(I=(\mathbb {Z}^3,26,6,B)\) be a three-dimensional (3D) digital image, let \(Q(I)\) be an associated cubical complex, and let \(\partial Q(I)\) be a subcomplex of \(Q(I)\) whose maximal cells are the quadrangles of \(Q(I)\) shared by a voxel of \(B\) in the foreground—the object under study—and by a voxel of \(\mathbb {Z}^3\backslash B\) in the background—the ambient space. We show how to simplify the combinatorial structure of \(\partial Q(I)\) and obtain a 3D polyhedral complex \(P(I)\) homeomorphic to \(\partial Q(I)\) but with fewer cells. We introduce an algorithm that computes cup products in \(H^*(P(I);\mathbb {Z}_2)\) directly from the combinatorics. The computational method introduced here can be effectively applied to any polyhedral complex embedded in \(\mathbb {R}^3\) .     

The shape of $$ \mathbb {Z}/\ell \mathbb {Z}$$-number fields

Let \(\ell \) be a prime and let \(L/ \mathbb {Q}\) be a Galois number field with Galois group isomorphic to \( \mathbb {Z}/\ell \mathbb {Z}\). We show that the shape of L, see Definition 1.2, is either \(\frac{1}{2}\mathbb {A}_{\ell -1}\) or a fixed sub-lattice depending only on \(\ell \); such a dichotomy in the value of the shape only depends on the type of ramification of L. This work is motivated by a result of Bhargava and Shnidman, and a previous work of the first named author, on the shape of \( \mathbb {Z}/3 \mathbb {Z}\) number fields.     

Mass formula and structure of self-dual codes over {{\bf Z}_{2^s}}

We look at the structure of and give a mass formula for self-dual codes over the ring ${{\bf Z}_{2^s}}$ of integers modulo 2 ^s . Together with earlier work on the case of odd primes, this completes the mass formula for self-dual codes for ${{\bf Z}_{p^s}}$ , for all prime numbers p and positive integers s.