首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
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  相似文献   

2.
In this work, we focus on cyclic codes over the ring \mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2{{{\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 (\mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2)/(xn-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 \mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2{{{\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 \mathbbF2+u\mathbbF2+v\mathbbF2+uv\mathbbF2{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} in general.  相似文献   

3.
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.  相似文献   

4.
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.  相似文献   

5.
Let R=GR(4,m) be the Galois ring of cardinality 4m 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 xR and if x=a+2b is the 2-adic representation of x with xT and bT, 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.  相似文献   

6.
We obtain a simple formula for the multiplicity of eigenvalues of the Hodge-Laplace operator, Δ f , acting on sections of the full exterior bundle over an arbitrary compact flat Riemannian n-manifold M with holonomy group , 1 ≤ kn − 1. This formula implies that any two such manifolds having isospectral lattices of translations are isospectral with respect to Δ f . As a consequence, we construct a large family of pairwise Δ f -isospectral and nonhomeomorphic n-manifolds of cardinality greater than . Supported by Conicet, Secyt-UNC.  相似文献   

7.
8.
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[z3]{\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.  相似文献   

9.
In this paper we pose some questions about superderivations on \({\mathbb {Z}}_{2}\)-graded rings. Then we consider the quaternion rings and upper triangular matrix rings with special \({\mathbb {Z}}_{2}\)-gradings and we check the answer to these questions about them.  相似文献   

10.
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...  相似文献   

11.
In this paper we consider free actions of large prime order cyclic groups on the product of any number of spheres of the same odd dimension and on products of two spheres of differing odd dimensions. We require only that the action be free on the product as a whole and not each sphere separately. In particular we determine equivariant homotopy type, and for both linear actions and for even numbers of spheres the simple homotopy type and simple structure sets. The results are compared to the analysis and classification done for lens spaces. Similar to lens spaces, the first k-invariant generally determines the homotopy type of many of the quotient spaces, however, the Reidemeister torsion frequently vanishes and many of the homotopy equivalent spaces are also simple homotopy equivalent. Unlike lens spaces, which are determined by their ρ-invariant and Reidemeister torsion, the ρ-invariant here vanishes for even numbers of spheres and linear actions and the Pontrjagin classes become p-localized homeomorphism invariants for a given dimension. The cohomology classes, Pontrjagin classes, and sets of normal invariants are computed in the process.  相似文献   

12.
A code C{{\mathcal C}} is \mathbbZ2\mathbbZ4{{\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 \mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-additive codes under an extended Gray map are called \mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes. In this paper, the invariants for \mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the rank and dimension of the kernel, are studied. Specifically, given the algebraic parameters of \mathbbZ2\mathbbZ4{{\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 \mathbbZ2\mathbbZ4{{\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 \mathbbZ2\mathbbZ4{{\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 \mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code for each possible pair (r, k) is given.  相似文献   

13.
Let Γ6 be the elliptic curve of degree 6 in PG(5, q) arising from a non-singular cubic curve of PG(2, q) via the canonical Veronese embedding
(1) If Γ6 (equivalently ) has n GF(q)-rational points, then the associated near-MDS code has length n and dimension 6. In this paper, the case q  =  5 is investigated. For q  =  5, the maximum number of GF(q)-rational points of an elliptic curve is known to be equal to ten. We show that for an elliptic curve with ten GF(5)-rational points, the associated near-MDS code can be extended by adding two more points of PG(5, 5). In this way we obtain six non-isomorphic [12, 6]5 codes. The automorphism group of is also considered.   相似文献   

14.
Designs, Codes and Cryptography - Applications of permutation polynomials in cryptography are closely related to their cycle structures. For example, many block ciphers use permutation polynomials...  相似文献   

15.
In this paper, we give a construction of partial difference sets in p 2 x p 2 x ... x p 2using 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.  相似文献   

16.
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.  相似文献   

17.

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.

  相似文献   

18.
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.  相似文献   

19.
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.  相似文献   

20.
We classify the profile curves of all surfaces with constant mean curvature in the product space , which are invariant under the action of a 1-parameter subgroup of isometries. The author was supported by INdAM (Italy) and Fapesp (Brazil).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号