$${{{\mathbb Z}_2}{{\mathbb Z}_4}}$$ -linear codes: generator matrices and duality

A code C{{\mathcal C}} is \mathbb Z₂\mathbb Z₄{{{\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). In this paper \mathbb Z₂\mathbb Z₄{{{\mathbb Z}_2}{{\mathbb Z}_4}} -additive codes are studied. Their corresponding binary images, via the Gray map, are \mathbb Z₂\mathbb Z₄{{{\mathbb Z}_2}{{\mathbb Z}_4}} -linear codes, which seem to be a very distinguished class of binary group codes. As for binary and quaternary linear codes, for these codes the fundamental parameters are found and standard forms for generator and parity-check matrices are given. In order to do this, the appropriate concept of duality for \mathbb Z₂\mathbb Z₄{{{\mathbb Z}_2}{{\mathbb Z}_4}} -additive codes is defined and the parameters of their dual codes are computed.     

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.     

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.     

All 4-Edge-Connected HHD-Free Graphs are {\mathbb{Z}_3}-Connected

An undirected graph G = (V, E) is called \mathbbZ₃{\mathbb{Z}_3}-connected if for all b: V ? \mathbbZ₃{b: V \rightarrow \mathbb{Z}_3} with ?_{v ? V}b(v)=0{\sum_{v \in V}b(v)=0}, an orientation D = (V, A) of G has a \mathbbZ₃{\mathbb{Z}_3}-valued nowhere-zero flow f: A? \mathbbZ₃-{0}{f: A\rightarrow \mathbb{Z}_3-\{0\}} such that ?_{e ? d⁺(v)}f(e)-?_{e ? d^-(v)}f(e)=b(v){\sum_{e \in \delta^+(v)}f(e)-\sum_{e \in \delta^-(v)}f(e)=b(v)} for all v ? V{v \in V}. We show that all 4-edge-connected HHD-free graphs are \mathbbZ₃{\mathbb{Z}_3}-connected. This extends the result due to Lai (Graphs Comb 16:165–176, 2000), which proves the \mathbbZ₃{\mathbb{Z}_3}-connectivity for 4-edge-connected chordal graphs.     

Ring of invariants of general linear group over local ring \mathbb{Z}_{p^m }

Let \mathbbZ_p^m \mathbb{Z}_{p^m } be the ring of integers modulo p ^m , where p is a prime and m ⩾ 1. The general linear group GL _n ( \mathbbZ_p^m \mathbb{Z}_{p^m } ) acts naturally on the polynomial algebra A _n := \mathbbZ_p^m \mathbb{Z}_{p^m } [x ₁, …, x _n ]. Denote by A_n^{GL₂ (\mathbbZ_pm )} A_n^{GL_2 (\mathbb{Z}_{p^m } )} the corresponding ring of invariants. The purpose of the present paper is to calculate this invariant ring. Our results also generalize the classical Dickson’s theorem.     

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.     

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

Characterizations of Bent and Almost Bent Function on {\mathbb{Z}_p^2}

Bent and almost-bent functions on \mathbbZ_p²{\mathbb{Z}_p^2} are studied in this paper. By calculating certain exponential sum and using a technique due to Hou (Finite Fields Appl 10:566–582, 2004), we obtain a degree bound for quasi-bent functions, and prove that almost-bent functions on \mathbbZ_p²{\mathbb{Z}_p^2} are equivalent to a degenerate quadratic form. From the viewpoint of relative difference sets, we also characterize bent functions on \mathbbZ_p²{\mathbb{Z}_p^2} in two classes of M{\mathcal{M}} ’s and PS{\mathcal{PS}} ’s, and show that the graph set corresponding to a bent function on \mathbbZ_p²{\mathbb{Z}_p^2} can be written as the sum of a graph set of M{\mathcal{M}} ’s type bent function and another group ring element. By using our characterization and some technique of permutation polynomial, we obtain the result: a bent function must be of M{\mathcal{M}} ’s type if its corresponding set contains more than (p − 3)/2 flats. A problem proposed by Ma and Pott (J Algebra 175:505–525, 1995) is therefore partially answered.     

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.     

Characterization of $ {\mathbb{A}_{16}} $ by a noncommuting graph

Let G be a finite non-Abelian group. We define a graph Γ _G ; called the noncommuting graph of G; with a vertex set G − Z(G) such that two vertices x and y are adjacent if and only if xy ≠ yx: Abdollahi, Akbari, and Maimani put forward the following conjecture (the AAM conjecture): If S is a finite non-Abelian simple group and G is a group such that Γ _S ≅ Γ _G ; then S ≅ G: It is still unknown if this conjecture holds for all simple finite groups with connected prime graph except \mathbbA₁₀ {\mathbb{A}_{10}} , L ₄(8), L ₄(4), and U ₄(4). In this paper, we prove that if \mathbbA₁₆ {\mathbb{A}_{16}} denotes the alternating group of degree 16; then, for any finite group G; the graph isomorphism G_\mathbbA16 @ G_G {\Gamma_{{\mathbb{A}_{16}}}} \cong {\Gamma_G} implies that \mathbbA₁₆ @ G {\mathbb{A}_{16}} \cong G .     

Finite-dimensional pointed Hopf algebras over $\mathbb{S}_4$

Let K be an algebraically closed field of characteristic 0. We conclude the classification of finite-dimensional pointed Hopf algebras whose group of group-likes is \mathbbS₄\mathbb{S}_4. We also describe all pointed Hopf algebras over \mathbbS₅\mathbb{S}_5 whose infinitesimal braiding is associated to the rack of transpositions.     

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

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

On finite 2-groups of the type $ {\mathbb{Z}_2} \wr G $

A wreath product of the type \mathbbZ₂ \wr G {\mathbb{Z}_2} \wr G is considered for any finite 2-group G. The monomorphism of such a group in the well-known Kaloujnine group P _2,m is studied for a suitable natural m.     

Open orbifold Gromov-Witten invariants of {[\mathbb{C}^3/\mathbb{Z}_n]}: localization and mirror symmetry

We develop a mathematical framework for the computation of open orbifold Gromov-Witten invariants of [\mathbbC³/\mathbbZ_n]{[\mathbb{C}^3/\mathbb{Z}_n]} and provide extensive checks with predictions from open string mirror symmetry. To this aim, we set up a computation of open string invariants in the spirit of Katz-Liu [23], defining them by localization. The orbifold is viewed as an open chart of a global quotient of the resolved conifold, and the Lagrangian as the fixed locus of an appropriate anti-holomorphic involution. We consider two main applications of the formalism. After warming up with the simpler example of [\mathbbC³/\mathbbZ₃]{[\mathbb{C}^3/\mathbb{Z}_3]} , where we verify physical predictions of Bouchard, Klemm, Mari?o and Pasquetti [4,5], the main object of our study is the richer case of [\mathbbC³/\mathbbZ₄]{[\mathbb{C}^3/\mathbb{Z}_4]} , where two different choices are allowed for the Lagrangian. For one choice, we make numerical checks to confirm the B-model predictions; for the other, we prove a mirror theorem for orbifold disc invariants, match a large number of annulus invariants, and give mirror symmetry predictions for open string invariants of genus ≤ 2.     

NTRU over rings beyond $${\mathbb{Z}}$$

The NTRU cryptosystem is constructed on the base ring \mathbbZ{\mathbb{Z}} . We give suitability conditions on rings to serve as alternate base rings. We present an example of an NTRU-like cryptosystem based on the Eisenstein integers \mathbbZ[z₃]{\mathbb{Z}[\zeta_3]} , which has a denser lattice structure than \mathbbZ{\mathbb{Z}} for the same dimension, and which furthermore presents a more difficult lattice problem for lattice attacks, for the same level of decryption failure security.     

$${{\mathbb {Z}}}_2$$-double cyclic codes

A binary linear code C is a \({\mathbb {Z}}_2\)-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the \({\mathbb {Z}}_2[x]\)-module \({\mathbb {Z}}_2[x]/(x^r-1)\times {\mathbb {Z}}_2[x]/(x^s-1).\) We determine the structure of \({\mathbb {Z}}_2\)-double cyclic codes giving the generator polynomials of these codes. We give the polynomial representation of \({\mathbb {Z}}_2\)-double cyclic codes and its duals, and the relations between the generator polynomials of these codes. Finally, we study the relations between \({{\mathbb {Z}}}_2\)-double cyclic and other families of cyclic codes, and show some examples of distance optimal \({\mathbb {Z}}_2\)-double cyclic codes.     

Non-Negative Integer Matrix Representations of a $\mathbb{Z}_{+}$-Ring

The $\mathbb{Z}_{+}$-ring is an important invariant in the theory of tensor category. In this paper, by using matrix method, we describe all irreducible $\mathbb{Z}_{+}$-modules over a $\mathbb{Z}_{+}$-ring $\mathcal{A}$, where $\mathcal{A}$ is a commutative ring with a $\mathbb{Z}_{+}$-basis{$1$, $x$, $y$, $xy$} and relations: $$ x^{2}=1,\;\;\;\;\; y^{2}=1+x+xy.$$We prove that when the rank of $\mathbb{Z}_{+}$-module $n\geq5$, there does not exist irreducible $\mathbb{Z}_{+}$-modules and when the rank $n\leq4$, there exists finite inequivalent irreducible $\mathbb{Z}_{+}$-modules, the number of which is respectively 1, 3, 3, 2 when the rank runs from 1 to 4.     

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.