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.     

Lexicographic Order and Linearity

Let be a list of all words of , lexicographically ordered with respect to some basis. Lexicodes are codes constructed from by applying a greedy algorithm. A short proof, only based on simple principles from linear algebra, is given for the linearity of these codes. The proof holds for any ordered basis, and for any selection criterion, thus generalizing the results of several authors. An extension of the applied technique shows that lexicodes over are linear for a wide choice of bases and for a large class of selection criteria. This result generalizes a property of Conway and Sloane.     

Hyperplane Sections of Kantor's Unitary Ovoids

The projective plane is embedded as a variety of projective points in , where M is a nine dimensional -module for the groupG=GL(3,q ²). The hyperplane sections of thisvariety and their stabilizers in the group G aredetermined. When q 2 (mod 3) one such hyperplanesection is a member of the family of Kantor's unitary ovoids.We furtherdetermine all sections whereD has codimension two in M and demonstratethat these are never empty. Consequences are drawn for Kantor'sovoids.     

Transversals of Families of Translations of a Planar Convex Compact

Let be a family of translations of a convex compact set such that every two elements of have a common point. Then there exist three points such that each element of contains one of these points. This answers in the affirmative an old question by Grünbaum. Bibliography: 13 titles.     

Extremal Self-Dual Codes over \mathbb{F} 2 × \mathbb{F} 2

In this paper, it is shown that extremal (Hermitian) self-dual codes over ₂ × ₂ exist only for lengths 1, 2, 3, 4, 5, 8 and 10. All extremal self-dual codes over ₂ × ₂ are found. In particular, it is shown that there is a unique extremal self-dual code up to equivalence for lengths 8 and 10. Optimal self-dual codes are also investigated. A classification is given for binary [12, 7, 4] codes with dual distance 4, binary [13, 7, 4] codes with dual distance 4 and binary [13, 8, 4] codes with dual distance 4.     

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.     

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.     

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

Two New Infinite Families of 3-Designs from Kerdock Codes over Z4

In this paper we show that the support of the codewords of each type in the Kerdock code of length 2^m over Z₄ form 3-designs for any odd integer . In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer . In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer , whose parameters are ,and .     

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 .     

Characterizations of Translation Generalized Quadrangles

If x is a regular point of the generalizedquadrangle of order (s,t), s 1 t, then x defines a dual net . If contains a line L of regularpoints and if for at least one point x on Lthe automorphism group of the dual net satisfies certain transitivityproperties, then is a translation generalized quadrangle. Thisresult has many applications. We give one example. Ifs=t 1, then is a dual affine plane. Let be a generalizedquadrangle of orders,s odd and s 1, which contains a lineL of regular points. If for at least one pointx on L the plane is Desarguesian, then is isomorphic to the classical generalizedquadrangleW(s).     

On Sparse Parity Check Matrices

We consider the extremal problem to determine the maximal number of columns of a 0-1 matrix with rows and at most ones in each column such that each columns are linearly independent modulo . For fixed integers and , we shall prove the probabilistic lower bound = ; for a power of , we prove the upper bound which matches the lower bound for infinitely many values of . We give some explicit constructions.     

K-Theory for the Banach Algebra of Operators on James''s Quasi-reflexive Banach Spaces

We prove that the K-groups of the Banach algebra of bounded, linear operators on the pth James space , where 1 < p < , are given by and . Moreover, for each Banach space and each non-zero, closed ideal contained in the ideal of inessential operators, we show that and . This enables us to calculate the K-groups of for each Banach space which is a direct sum of finitely many James spaces and -spaces.     

The Geometry of the Lie Algebra of the Orthogonal Group O(ℝ4)

In the six-dimensional space of bivectors, a Lie product similar to the standard vector product in is introduced. The Lie algebra constructed is proved to be isomorphic to the Lie algebra of the orthogonal group , and the isomorphism is a canonical isometry between and the space of antisymmetric operators in . Bibliography: 2 titles.     

Cobordisms of Embeddings with Codimension Two

We single out the obstruction for a closed -null-homologous submanifold of codimension 2 to be the boundary of a submanifold of codimension 1. As an application, we calculate the groups of cobordisms of embeddings of nonoriented n-manifolds in the Euclidean (n+2)-space for n=3 and 4. Namely, we show that and . A specific generator of the former group is explicitly given. Bibliography: 5 titles.     

A Theorem Concerning Nets Arising from Generalized Quadrangles with a Regular Point

Suppose is a generalized quadrangle (GQ) of order , with a regular point. Then there is a net which arises from this regular point. We prove that if such a net has a proper subnet with the same degree as the net, then it must be an affine plane of order t. Also, this affine plane induces a proper subquadrangle of order t containing the regular point, and we necessarily have that . This result has many applications, of which we give one example. Suppose is an elation generalized quadrangle (EGQ) of order , with elation point p. Then is called a skew translation generalized quadrangle (STGQ) with base-point p if there is a full group of symmetries about p of order t which is contained in the elation group. We show that a GQ of order s is an STGQ with base-point p if and only if p is an elation point which is regular.     

Tissus linéaires et théorèmes d'algébrisation de type Abdel-inverse et Reiss-inverse

A d-web in ( ,0) is given by d complex analytic foliations of codimension one in ( ,0) which are in general position. A d-web in ( ,0) is linear if all the leaves are (pieces of) hyperplanes in and is algebraic if it is associated, by duality, to a nondegenerate algebraic curve in of degree d. We characterize linear webs in ( ,0). We give explicit conditions under which a linear d-web in ( ,0) is algebraic and we obtain equations for in this case. Some related problems are discussed and some questions are posed.     

Spin Models and Strongly Hyper-Self-Dual Bose-Mesner Algebras

We introduce the notion of hyper-self-duality for Bose-Mesner algebras as a strengthening of formal self-duality. Let denote a Bose-Mesner algebra on a finite nonempty set X. Fix p X, and let and denote respectively the dual Bose-Mesner algebra and the Terwilliger algebra of with respect to p. By a hyper-duality of , we mean an automorphism of such that for all ; and is a duality of . is said to be hyper-self-dual whenever there exists a hyper-duality of . We say that is strongly hyper-self-dual whenever there exists a hyper-duality of which can be expressed as conjugation by an invertible element of . We show that Bose-Mesner algebras which support a spin model are strongly hyper-self-dual, and we characterize strong hyper-self-duality via the module structure of the associated Terwilliger algebra.     

A New Cover of the 3-Local Geometry of Co1

The 3-local geometry of the sporadic simple group Co₁ has been known to have a cover with a flag-transitive automorphism group which is a nonsplit extension of an elementary Abelian 2-group of rank 24 (the Leech lattice modulo 2) by Co₁. It was conjectured that was simply connected. We disprove this conjecture by constructing a double cover of . The automorphism group of is of the shape . However, it is not isomorphic to the involution centralizer of the Monster sporadic simple group.     

On Large Deviations of Vector-Valued Additive Functions of a Markov Gaussian Field

We prove a local limit theorem for large deviations of the sums , where , is a Markov Gaussian random field, is a bounded vector-valued function, and . This paper generalizes the paper [13].