Optimal Subcodes of Second Order Reed-Muller Codes andMaximal Linear Spaces of Bivectors of Maximal Rank

There are exactlytwo non-equivalent [32,11,12]-codes in the binaryReed-Muller code which contain and have the weight set {0,12,16,20,32}. Alternatively,the 4-spaces in the projective space over the vector space for which all points have rank 4 fall into exactlytwo orbits under the natural action of PGL(5) on .     

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.     

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.     

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

Canonical Heights on Elliptic Curves in Characteristic p

Let be the rational function field with finite constant field and characteristic , and let K/k be a finite separable extension. For a fixed place v of k and an elliptic curve E/K which has ordinary reduction at all places of K extending v, we consider a canonical height pairing which is symmetric, bilinear and Galois equivariant. The pairing for the infinite place of k is a natural extension of the classical Néron–Tate height. For v finite, the pairing plays the role of global analytic p-adic heights. We further determine some hypotheses for the nondegeneracy of these pairings.     

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.     

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 .     

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.     

On Complete Arcs Arising from Plane Curves

We point out an interplay between -Frobenius non-classical plane curves and complete -arcs in . A typical example that shows how this works is the one concerning an Hermitian curve. We present some other examples here which give rise to the existence of new complete -arcs with parameters and being a power of the characteristic. In addition, for q a square, new complete -arcs with either and or and are constructed by using certain reducible plane curves.     

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 .     

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.     

On the Nonexistence of q-ary Linear Codes of Dimension Five

There do not exist codes over the Galois field GF attaining the Griesmer bound for for andfor for .     

The Spectrum of the C*-Algebra of Pseudodifferential Boundary Value Problems on a Manifold with Smooth Edges

The C ^*-algebra generated by the operators of pseudodifferential boundary value problems on a manifold with smooth closed disjoint edges and boundary is studied. The operators act in the space L ₂( ) L ₂( ). The goal of this paper is to describe all (up to an equivalence) irreducible representations of the algebra Bibliography: 12 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.     

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.     

On (q 2 + q + 2, q + 2)-arcs in the Projective Plane PG(2, q)

A (k,n)-arc in PG(2,q) is usually defined to be a set of k points in the plane such that some line meets in n points but such that no line meets in more than n points. There is an extensive literature on the topic of (k,n)-arcs. Here we keep the same definition but allow to be a multiset, that is, permit to contain multiple points. The case k=q ²+q+2 is of interest because it is the first value of k for which a (k,n)-arc must be a multiset. The problem of classifying (q ²+q+2,q+2)-arcs is of importance in coding theory, since it is equivalent to classifying 3-dimensional q-ary error-correcting codes of length q ²+q+2 and minimum distance q ². Indeed, it was the coding theory problem which provided the initial motivation for our study. It turns out that such arcs are surprisingly rich in geometric structure. Here we construct several families of (q ²+q+2,q+2)-arcs as well as obtain some bounds and non-existence results. A complete classification of such arcs seems to be a difficult problem.     

On Lower Bounds For Covering Codes

We study lower bounds on K(n,R), the minimum number of codewords of any binary code of length n such that the Hamming spheres of radius R with center at codewords cover the Hamming space . We generalize Honkala's idea toobtain further improvements only by using some simple observationsof Zhang's result. This leads to nineteen improvements of thelower bound on K(n,R) within the range of .     

Constructions of Nested Partial Difference Sets with Galois Rings

There have been several recent constructions of partial difference sets (PDSs) using the Galois rings for p a prime and t any positive integer. This paper presents constructions of partial difference sets in where p is any prime, and r and t are any positive integers. For the case where 2$$ " align="middle" border="0"> many of the partial difference sets are constructed in groups with parameters distinct from other known constructions, and the PDSs are nested. Another construction of Paley partial difference sets is given for the case when p is odd. The constructions make use of character theory and of the structure of the Galois ring , and in particular, the ring × . The paper concludes with some open related problems.     

Nonuniqueness Sequences for Weighted Algebras of Holomorphic Functions in the Unit Circle

Suppose that is a system of continuous subharmonic functions in the unit disk and is the class of holomorphic functions f in such that log|f(z)| ≤ B _f p _f (z) + C _f , z ∈ , where B _f and C _f are constants and p _f ∈ . We obtain sufficient conditions for a given number sequence Λ = { λ_n} ⊂ to be a subsequence of zeros of some nonzero holomorphic function from , i.e., Λ is a nonuniqueness sequence for .__________Translated from Matematicheskie Zametki, vol. 77, no. 5, 2005, pp. 775–787.Original Russian Text Copyright ©2005 by L. Yu. Cherednikova.     

The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem

Let be an elliptic curve defined over a finite field, and let be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks that an integer m be found so that S=mT in . In this note we give a new algorithm, termed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete logarithm problem for and to the integer factorization problem.