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.     

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.     

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 Linear Codes over $${\mathbb{Z}}_{2^{s}}$$

In an earlier paper the authors studied simplex codes of type α and β over and obtained some known binary linear and nonlinear codes as Gray images of these codes. In this correspondence, we study weight distributions of simplex codes of type α and β over The generalized Gray map is then used to construct binary codes. The linear codes meet the Griesmer bound and a few non-linear codes are obtained that meet the Plotkin/Johnson bound. We also give the weight hierarchies of the first order Reed-Muller codes over The above codes are also shown to satisfy the chain condition.A part of this paper is contained in his Ph.D. Thesis from IIT Kanpur, India     

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.     

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.     

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.     

On some classes of linear codes over $${\mathbb {Z}}_{2}{\mathbb {Z}}_{4}$$ and their covering radii

In this paper, we define the simplex and MacDonald codes of types \(\alpha \) and \(\beta \) over \({\mathbb {Z}}_{2}{\mathbb {Z}}_{4}\). We also examine the covering radii of these codes. Further, we study the binary images of these codes and prove that the binary image of the simplex codes of type \(\alpha \) meets the Gilbert bound.     

On linear functional equations modulo $${\mathbb {Z}}$$ Z

Aequationes mathematicae - In this paper, we consider the condition $$\sum _{i=0}^{n+1}\varphi _i(r_ix+q_iy)\in {\mathbb {Z}}$$ for real valued functions defined on a linear space V. We derive...     

A Construction of Partial Difference Sets in {\mathbb{Z}}_{p^{2 \times } } {\mathbb{Z}}_{p^{2 \times \cdot \cdot \cdot \times } } {\mathbb{Z}}_{p^2 }

In this paper, we give a construction of partial difference sets in _p ² x _p ² x ... x _p ²using some finite local rings.Dedicated to Hanfried Lenz on the occasion of his 80th birthdayThe work of this paper was done when the authors visited the University of Hong Kong.     

$$L^p$$Lp-Boundedness and $$L^p$$Lp-Nuclearity of Multilinear Pseudo-differential Operators on $${\mathbb {Z}}^n$$Zn and the Torus $${\mathbb {T}}^n$$Tn

In this article, we begin a systematic study of the boundedness and the nuclearity properties of multilinear periodic pseudo-differential operators and multilinear discrete pseudo-differential operators on \(L^p\)-spaces. First, we prove analogues of known multilinear Fourier multipliers theorems (proved by Coifman and Meyer, Grafakos, Tomita, Torres, Kenig, Stein, Fujita, Tao, etc.) in the context of periodic and discrete multilinear pseudo-differential operators. For this, we use the periodic analysis of pseudo-differential operators developed by Ruzhansky and Turunen. Later, we investigate the s-nuclearity, \(0<s \le 1,\) of periodic and discrete pseudo-differential operators. To accomplish this, we classify those s-nuclear multilinear integral operators on arbitrary Lebesgue spaces defined on \(\sigma \)-finite measures spaces. We also study similar properties for periodic Fourier integral operators. Finally, we present some applications of our study to deduce the periodic Kato–Ponce inequality and to examine the s-nuclearity of multilinear Bessel potentials as well as the s-nuclearity of periodic Fourier integral operators admitting suitable types of singularities.

     

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.     

On self-dual codes over {\mathbb{F}}_5

The purpose of this paper is to improve the upper bounds of the minimum distances of self-dual codes over for lengths [22, 26, 28, 32–40]. In particular, we prove that there is no [22, 11, 9] self-dual code over , whose existence was left open in 1982. We also show that both the Hamming weight enumerator and the Lee weight enumerator of a putative [24, 12, 10] self-dual code over are unique. Using the building-up construction, we show that there are exactly nine inequivalent optimal self-dual [18, 9, 7] codes over up to the monomial equivalence, and construct one new optimal self-dual [20, 10, 8] code over and at least 40 new inequivalent optimal self-dual [22, 11, 8] codes.      

Heat Kernel Empirical Laws on $${\mathbb {U}}_N$$ and $${\mathbb {GL}}_N$$GLN

This paper studies the empirical laws of eigenvalues and singular values for random matrices drawn from the heat kernel measures on the unitary groups \({\mathbb {U}}_N\) and the general linear groups \({\mathbb {GL}}_N\), for \(N\in {\mathbb {N}}\). It establishes the strongest known convergence results for the empirical eigenvalues in the \({\mathbb {U}}_N\) case, and the first known almost sure convergence results for the eigenvalues and singular values in the \({\mathbb {GL}}_N\) case. The limit noncommutative distribution associated with the heat kernel measure on \({\mathbb {GL}}_N\) is identified as the projection of a flow on an infinite-dimensional polynomial space. These results are then strengthened from variance estimates to \(L^p\) estimates for even integers p.     

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.