Cyclic codes over the rings Z 2?+ uZ 2 and Z 2?+ uZ 2?+ u 2 Z 2

In this paper, we study cyclic codes over the rings Z ₂ + uZ ₂ and Z ₂ + uZ ₂ + u ² Z ₂ . We find a set of generators for these codes. The rank, the dual, and the Hamming distance of these codes are studied as well. Examples of cyclic codes of various lengths are also studied.      

3-Designs from the Z 4-Goethals Codes via a New Kloosterman Sum Identity

Recently, active research has been performed on constructing t-designs from linear codes over Z ₄. In this paper, we will construct a new simple 3 – (2 ^m , 7, 14/3 (2 ^m – 8)) design from codewords of Hamming weight 7 in the Z ₄-Goethals code for odd m 5. For 3 arbitrary positions, we will count the number of codewords of Hamming weight 7 whose support includes those 3 positions. This counting can be simplified by using the double-transitivity of the Goethals code and divided into small cases. It turns out interestingly that, in almost all cases, this count is related to the value of a Kloosterman sum. As a result, we can also prove a new Kloosterman sum identity while deriving the 3-design.     

Weight distribution of Preparata codes over Z 4 and the construction of 3-designs

In this paper,we calculate the number of the codewords(with Hamming weight 7)of each type in the Preparata codes over Z4,then give the parameter sets of 3-designs constructed from the supports of the codewords of each type.Moreover,we prove that the first two families of 3-designs are simple and the third family of the 3-designs has repeated blocks.     

Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes

The Goethals code is a binary nonlinear code of length 2^m+1 which has codewords and minimum Hamming distance 8 for any odd . Recently, Hammons et. al. showed that codes with the same weight distribution can be obtained via the Gray map from a linear code over Z ₄of length 2^m and Lee distance 8. The Gray map of the dual of the corresponding Z ₄ code is a Delsarte-Goethals code. We construct codes over Z ₄ such that their Gray maps lead to codes with the same weight distribution as the Goethals codes and the Delsarte-Goethals codes.     

Campopiano-type bounds in non-Hamming array coding

Campopiano [C.N. Campopiano, Bounds on burst error correcting codes, IRE Trans. IT-8 (1962) 257-259] obtained an upper bound for burst error correction in classical coding systems where codes are subsets/subspaces of the space , the space of all n-tuples with entries from a finite field F_q equipped with the Hamming metric. In [S. Jain, Bursts in m-metric array codes, Linear Algebra Appl., in press], the author introduced the notion of burst errors for m-metric array coding systems where m-metric array codes are subsets/subspaces of the space Mat_m×s(F_q), the linear space of all m × s matrices with entries from a finite field F_q, endowed with a non-Hamming metric and obtained some lower bounds for burst error correction. In this paper, we obtain various construction upper bounds on the parameters of m-metric array codes for the detection and correction of burst errors.     

On the binary codes with parameters of triply-shortened 1-perfect codes

We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary (n?=?2 ^m ? 3, 2 ^n-m-1, 4) code C, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of an equitable partition of the n-cube into six cells. An arbitrary binary (n?=?2 ^m ? 4, 2 ^n-m , 3) code D, i.e., a code with parameters of a triply-shortened Hamming code, is a cell of an equitable family (but not a partition) with six cells. As a corollary, the codes C and D are completely semiregular; i.e., the weight distribution of such codes depends only on the minimal and maximal codeword weights and the code parameters. Moreover, if D is self-complementary, then it is completely regular. As an intermediate result, we prove, in terms of distance distributions, a general criterion for a partition of the vertices of a graph (from rather general class of graphs, including the distance-regular graphs) to be equitable.     

Non-invertible-element constacyclic codes over finite PIRs

In this paper we introduce the notion of λ-constacyclic codes over finite rings R for arbitrary element λ of R. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal rings (PIRs). We determine the algebraic structures of all NIE-constacyclic codes over finite chain rings, give the unique form of the sets of the defining polynomials and obtain their minimum Hamming distances. A general form of the duals of NIE-constacyclic codes over finite chain rings is also provided. In particular, we give a necessary and sufficient condition for the dual of an NIE-constacyclic code to be an NIE-constacyclic code. Using the Chinese Remainder Theorem, we study the NIE-constacyclic codes over finite PIRs. Furthermore, we construct some optimal NIE-constacyclic codes over finite PIRs in the sense that they achieve the maximum possible minimum Hamming distances for some given lengths and cardinalities.     

关于有限Abelian群的生成子集的基数

假若G =Z_m1 Z_m2… Z_mr 为 (m₁, m₂,…, m_r)型Abelian群, 其中Z_mi 为 m_i 阶的循环群且1≤i≤ r, m₁ |m₂|…| m_r, S 为G 的满足0∈ S=-S 的生成子集. 如果 |S|>|G|/ρ, 其中ρ≥l m_r /2l且m_r=e(G) 为群 G 的所有元素的阶的最小公倍数, 则ρS=G. 更进一步作者推广了Klopsch与lev ^[1]的一个结论,有:若 G=Z₂Z_m 为 (2, m) 型 Abelian 群(m ≥8), 则 t_m/2(G)=0.     

An Assmus–Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z 4

The complete weight enumerator of the Delsarte–Goethals code over Z ₄ is derived and an Assmus–Mattson-type approach at identifying t-designs in linear codes over Z ₄ is presented. The Assmus–Mattson-type approach, in conjunction with the complete weight enumerator are together used to show that the codewords of constant Hamming weight in both the Goethals code over Z ₄ as well as the Delsarte–Goethals code over Z ₄ yield 3-designs, possibly with repeated blocks.     

When are intermediate processes of the same stochastic order?

Let Z_m⁽ⁿ⁾ represent the mth largest order statistic in a random sample of size n. Here we study the process Z_[mt]⁽ⁿ⁾, t > 0, where m(n) is an intermediate sequence such that m → ∞, m/n → 0 as n → ∞.     

Weighted Hamming metric structures

It is known that the binary generalized Goppa codes are perfect codes for the weighted Hamming metrics. In this paper, we present the existence of a weighted Hamming metric that admits a binary Hamming code (resp. an extended binary Hamming code) to be perfect code. For a special weighted Hamming metric, we also give some structures of a 2-perfect code, show how to construct a 2-perfect linear code and obtain the weight distribution of a 2-perfect code from the partial information of the code.     

On the Generalized Weights of a Class of Trace Codes

We build a class of codes using hermitian forms and the functional trace code. Then we give a general expression of the rth minimum distance of our code and compute general bounds for the weight hierarchy by using exponential sums. We also get the minimum distance and calculate the rth generalized Hamming weight d_r in some special cases.     

About spherical functions onSL(2,ℝ)

In this paper, we will discuss some properties of the (n, m)-spherical functions on the Lie groupG = SL(2,ℝ), and obtain the decomposition off inC _c ⁴ (G) into these functions. Also we give the Fourier inversion formula for the (n, m)-spherical functions inC _c ³ (G).     

Plane partitions IV: A conjecture of Mills—Robbins—Rumsey

In this paper we consider a problem posed by W Mills D Robbins and H Rumsey for a certain plane partition generating functionZ _n (x, m) The special caseZ _n (1,m) is the generating function that arose in the weak Macdonald conjecture Mills—Robbins—Rumsey conjectured thatZ _n (2,m) also possesses a nice finite product representation Their conjecture is proved as Theorem 1 The method of proof resembles that of the evaluation ofZ _n (1,m) given previously Many results for the₃ F ₂ hypergeometric function are required including Whipple's theorem, the Pfaff-Saalschutz summation and contiguous relations In passing we note that our Lemma 2 provides a new and simpler representation ofZ _n (2,m) as a determinant $$Z_n (2,m) = \det \left( {\delta _{ij} + \sum\limits_{t = 0}^1 {\left( {\mathop {m + j + t}\limits_t } \right)} \left( {\mathop {m + t}\limits_{m + t} } \right)} \right)_{0 \leqq ij \leqq n - 1} $$ Conceivably this new representation may provide new interpretations of the combinatorial significance ofZ _n (2,m) In the final analysis, one would like a combinatorial explanation ofZ _n (2,m) that would provide an algorithmic proof of the Mills Robbins—Rumsey conjecture     

Duadic Z4-Codes

The structure of abelian Z₄-codes (and more generally Z_p^m-codes) is studied. The approach is spectral: discrete Fourier transform and idempotents. A criterion for self-duality is derived. An arithmetic test on the length for the existence of nontrivial abelian self-dual codes is derived. A natural generalization of both the supplemented quadratic residue codes and the binary duadic codes is introduced. Isodual abelian Z₄ codes are considered, constructed, and used to produce 4-modular lattices.     

Relation between frobenius and 2-frobenius groups with order components of finite groups

IfG is a finite group, we define its prime graph Г(G), as follows: its vertices are the primes dividing the order ofG and two verticesp, q are joined by an edge, if there is an element inG of orderpq. We denote the set of all the connected components of the graph Г(G) by T(G)= {π_i(G), fori = 1,2, …,t(G)}, where t(G) is the number of connected components of Г(G). We also denote by π(n) the set of all primes dividingn, wheren is a natural number. Then ¦G¦ can be expressed as a product of m₁, m₂, …, m_t(G), where m_i’s are positive integers with π(m_i) = π_i. Thesem _i ’s are called the order components ofG. LetOC(G) := {m ₁,m ₂, …,m _t (G)} be the set of order components ofG. In this paper we prove that, if G is a finite group andOC(G) =OC(M), where M is a finite simple group witht(M) ≥ 2, thenG is neither Frobenius nor 2-Frobenius.     

Plane partitions IV: A conjecture of Mills—Robbins—Rumsey

In this paper we consider a problem posed by W Mills D Robbins and H Rumsey for a certain plane partition generating functionZ _n (x, m) The special caseZ _n (1,m) is the generating function that arose in the weak Macdonald conjecture Mills—Robbins—Rumsey conjectured thatZ _n (2,m) also possesses a nice finite product representation Their conjecture is proved as Theorem 1 The method of proof resembles that of the evaluation ofZ _n (1,m) given previously Many results for the₃ F ₂ hypergeometric function are required including Whipple's theorem, the Pfaff-Saalschutz summation and contiguous relations In passing we note that our Lemma 2 provides a new and simpler representation ofZ _n (2,m) as a determinant $$Z_n (2,m) = \det \left( {\delta _{ij} + \sum\limits_{i = 0}^l {\left( {\begin{array}{*{20}c} {m + j + t} \\ t \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {m + i} \\ {m + t} \\ \end{array} } \right)} } \right)_{0 \leqq ij \leqq n - 1} $$ Conceivably this new representation may provide new interpretations of the combinatorial significance ofZ _n (2,m) In the final analysis, one would like a combinatorial explanation ofZ _n (2,m) that would provide an algorithmic proof of the Mills Robbins—Rumsey conjecture     

On the Construction of Some Type II Codes over Z 4×Z4

We consider here the construction of Type II codes over the abelian group Z₄×Z₄. The definition of Type II codes here is based on the definitions introduced by Bannai [2]. The emphasis is given on the construction of these types of codes over the abelian group Z₄×Z₄ and in particular, the methods applied by Gaborit [7] in the construction of codes over Z₄ was extended to four different dualities with their corresponding weight functions (maps assigning weights to the alphabets of the code). In order to do this, we use the flattened form of the codes and construct binary codes analogous to the ones applied to Z₄ codes. Since each duality generates more than one weight function, we focus on those weights satisfying the squareness property. Here, by the squareness property, we mean that the weight function wt assigns the weight 0 to the Z₄×Z₄ elements (0, 0),(2, 2) and the weight 4 to the elements (0, 2) and (2, 0). The main results of this paper are focused on the characterization of these codes and provide a method of construction that can be applied in the generation of such codes whose weight functions satisfy the squareness property.