Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

We prove the existence of a cyclic (4p, 4, 1)-BIBD—and hence, equivalently, that of a cyclic (4, 1)-GDD of type 4 ^p —for any prime such that (p–1)/6 has a prime factor q not greater than 19. This was known only for q=2, i.e., for . In this case an explicit construction was given for . Here, such an explicit construction is also realized for .We also give a strong indication about the existence of a cyclic (4p 4, 1)-BIBD for any prime , p>7. The existence is guaranteed for p>(2q ³–3q ²+1)²+3q ² where q is the least prime factor of (p–1)/6.Finally, we prove, giving explicit constructions, the existence of a cyclic (4, 1)-GDD of type 6 ^p for any prime p>5 and the existence of a cyclic (4, 1)-GDD of type 8 ^p for any prime . The result on GDD's with group size 6 was already known but our proof is new and very easy.All the above results may be translated in terms of optimal optical orthogonal codes of weight four with =1.     

Automorphisms of Constant Weight Codes and of Divisible Designs

We show that the automorphism group of a divisible design is isomorphic to a subgroup H of index 1 or 2 in the automorphism group of the associated constant weight code. Only in very special cases H is not the full automorphism group.     

A Class of Perfect Ternary Constant-Weight Codes

We construct a class of perfect ternary constant-weight codes of length 2 ^r , weight 2 ^r -1 and minimum distance 3. The codes have codewords. The construction is based on combining cosets of binary Hamming codes. As a special case, for r=2 the construction gives the subcode of the tetracode consisting of its nonzero codewords. By shortening the perfect codes, we get further optimal codes.     

Spectral-Null Codes and Null Spaces of Hadamard Submatrices

Codes of length 2 ^m over {1, -1} are defined as null spaces of certain submatrices of Hadamard matrices. It is shown that the codewords of all have an rth order spectral null at zero frequency. Establishing the connection between and the parity-check matrix of Reed-Muller codes, the minimum distance of is obtained along with upper bounds on the redundancy of . An efficient algorithm is presented for encoding unconstrained binary sequences into .     

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.     

Combinatorial S >n-Modules as Codes

Certain -modules related to the kernels ofincidence maps between types in the poset defined by the natural productorder on the set of n-tuples with entries from {1, ,m} are studied as linear codes (whencoefficients are extended to an arbitrary field K). Theirdimensions and minimal weights are computed. The Specht modules areextremal among these submodules. The minimum weight codewords of theSpecht module are shown to be scalar multiples of polytabloids. Ageneralization of t-design arising from the natural permutationS _n-modules labelled by partitions with mparts is introduced. A connection with Reed-Muller codes is noted and acharacteristic free formulation is presented.     

Stickelberger Codes

Let p be an odd prime and be a primitive p th root of unity over . The Galois group G of over is a cyclic group of order p-1. The integral group ring [G] contains the Stickelberger ideal S _p which annihilates the ideal class group of K. In this paper we investigate the parameters of cyclic codes S _p (q) obtained as reductions of S _p modulo primes q which we call Stickelberger codes. In particular, we show that the dimension of S _p (p) is related to the index of irregularity of p, i.e., the number of Bernoulli numbers B _2k , , which are divisible by p. We then develop methods to compute the generator polynomial of S _p (p). This gives rise to anew algorithm for the computation of the index of irregularity of a prime. As an application we show that 20,001,301 is regular. This significantly improves a previous record of 8,388,019 on the largest explicitly known regular prime.     

Singly-Even Self-Dual Codes of Length 40

All singly-even self-dual [40,20,8] binary codes which have an automorphism of prime order are obtained up to equivalence. There are two inequivalent codes with an automorphism of order 7 and 37 inequivalent codes with an automorphism of order 5. These codes have highest possible minimal distance and some of them are the first known codes with weight enumerators prescribed by Conway and Sloane.     

On Codes Identifying Sets of Vertices in Hamming Spaces

A code is called (t, 2)-identifying if for all the words x, y(x y) and the sets (B _t (x) B _t (y)) C and are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of -identifying codes and introduce weakly identifying codes.     

Type II Self-Dual Codes over Finite Rings and Even Unimodular Lattices

In this paper, we investigate self-dual codes over finite rings, specifically the ring of integers modulo 2m. Type II codes over are introduced as self-dual codes with Euclidean weights which are a multiple of 2m +1. We describe a relationship between Type II codes and even unimodular lattices. This relationship provides much information on Type II codes. Double circulant Type II codes over are also studied.     

New Linear Codes Over \mathbb{F}_3 and \mathbb{F}_5 and Improvements on Bounds

One of the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, we generalize the method introduced by [8] and obtain new codes which improve the best known minimum distance bounds of some linear codes. We have found a new linear ternary code and 8 new linear codes over with improved minimumdistances. First we introduce a generalized version of Gray map,then we give definition of quasi cyclic codes and introduce nearlyquasi cyclic codes. Next, we give the parameters of new codeswith their generator matrices. Finally, we have included twotables which give Hamming weight enumerators of these new codes.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.     

The Invariants of the Clifford Groups

The automorphism group of the Barnes-Wall lattice L _m in dimension 2 ^m (m ; 3) is a subgroup of index 2 in a certain Clifford group of structure 2 ₊ ^1+2m . O ⁺(2m,2). This group and its complex analogue of structure .Sp(2m, 2) have arisen in recent years in connection with the construction of orthogonal spreads, Kerdock sets, packings in Grassmannian spaces, quantum codes, Siegel modular forms and spherical designs. In this paper we give a simpler proof of Runge@apos;s 1996 result that the space of invariants for of degree 2k is spanned by the complete weight enumerators of the codes , where C ranges over all binary self-dual codes of length 2k; these are a basis if m k - 1. We also give new constructions for L _m and : let M be the -lattice with Gram matrix . Then L _m is the rational part of M ^m, and = Aut(M^m). Also, if C is a binary self-dual code not generated by vectors of weight 2, then is precisely the automorphism group of the complete weight enumerator of . There are analogues of all these results for the complex group , with doubly-even self-dual code instead of self-dual code.     

The Classification of Some Perfect Codes

Perfect 1-error correcting codes C in Z ₂ ⁿ , where n=2 ^m–1, are considered. Let ; denote the linear span of the words of C and let the rank of C be the dimension of the vector space . It is shown that if the rank of C is n–m+2 then C is equivalent to a code given by a construction of Phelps. These codes are, in case of rank n–m+2, described by a Hamming code H and a set of MDS-codes D _h , h H, over an alphabet with four symbols. The case of rank n–m+1 is much simpler: Any such code is a Vasil'ev code.     

Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve

We consider the quotient of the Hermitian curve defined by the equation y^q + y = x^m over where m > 2 is a divisor of q+1. For 2≤ r ≤ q+1, we determine the Weierstrass semigroup of any r-tuple of -rational points on this curve. Using these semigroups, we construct algebraic geometry codes with minimum distance exceeding the designed distance. In addition, we prove that there are r-point codes, that is codes of the form where r ≥ 2, with better parameters than any comparable one-point code on the same curve. Some of these codes have better parameters than comparable one-point Hermitian codes over the same field. All of our results apply to the Hermitian curve itself which is obtained by taking m=q +1 in the above equation Communicated by: J.W.P. Hirschfeld     

Uniformly Packed Codes and More Distance Regular Graphs from Crooked Functions

Let V and W be n-dimensional vector spaces over GF(2). A function Q : V W is called crooked (a notion introduced by Bending and Fon-Der-Flaass) if it satisfies the following three properties:

True Dimension of Some Binary Quadratic Trace Goppa Codes

We compute in this paper the true dimension over of Goppa Codes (L, g) defined by the polynomial proving, this way, a conjecture stated in [14,16].     

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

On the Minimum Length of q-ary Linear Codes of Dimension Five

Let be the smallest integer n for which there exists a linear code of length n, dimension k and minimum Hamming distance d over the Galois field GF(q). In this paper we determine for for all q, using a geometric method.     

Matrix Groups Related to the Quaternion Group and Spherical Orbit Codes

We consider a finite matrix group with 3⁴· 2¹⁶ elements, which is a subgroup of the infinite group , where is the regular representation of the quaternion group and C is a matrix that transforms the regular representation Q to its cellwise-diagonal form. There is a number of ways to define the matrix C. Our aim is to make the group similar in a certain sense to a finite group. The eventual choice of an appropriate matrix C done heuristically. We study the structure of the group and use this group to construct spherical orbit codes on the unit Euclidean sphere in R⁸. These codes have code distance less than 1. One of them has 3²· 2⁸ = 2304 elements and its squared Euclidean code distance is 0.293. Communicated by: V. A. Zinoviev