On tight projective designs

It is shown that among all tight designs in , where is or , or (quaternions), only 5-designs in (Lyubich, Shatalora Geom Dedicata 86: 169–178, 2001) have irrational angle set. This is the only case of equal ranks of the first and the last irreducible idempotent in the corresponding Bose-Mesner algebra.      

Algebraic-geometry codes, one-point codes, and evaluation codes

One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes and Reed–Muller codes. Given an -algebra A, an order function on A and given a surjective -morphism of algebras , the ith evaluation code with respect to is defined as the code . In this work it is shown that under a certain hypothesis on the -algebra A, not only any evaluation code is a one-point code, but any sequence of evaluation codes is a sequence of one-point codes. This hypothesis on A is that its field of fractions is a function field over and that A is integrally closed. Moreover, we see that a sequence of algebraic-geometry codes G _i with associated divisors is the sequence of evaluation codes associated to some -algebra A, some order function and some surjective morphism with if and only if it is a sequence of one-point codes.      

Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in $${\mathbb{P}^{4}(\mathbb{F}_q)}$$

We study the functional codes of second order on a non-degenerate Hermitian variety as defined by G. Lachaud. We provide the best possible bounds for the number of points of quadratic sections of . We list the first five weights, describe the corresponding codewords and compute their number. The paper ends with two conjectures. The first is about minimum distance of the functional codes of order h on a non-singular Hermitian variety . The second is about distribution of the codewords of first five weights of the functional codes of second order on a non-singular Hermitian variety .      

The nonexistence of near-extremal formally self-dual codes

A code is called formally self-dual if and have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over , and . These codes are called extremal if their minimum distances achieve the Mallows-Sloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally self-dual (f.s.d.) codes. With Zhang’s systematic approach, we determine possible lengths for which the four types of near-extremal formally self-dual codes as well as the two types of near-extremal formally self-dual additive codes cannot exist. In particular, our result on the nonexistence of near-extremal binary f.s.d. even codes of any even length n completes all the cases since only the case 8|n was dealt with by Han and Lee.      

Elements of Prescribed Order,Prescribed Traces and Systems of Rational Functions Over Finite Fields

Let k 1 and be a system of rational functions forming a strongly linearly independent set over a finite field . Let be arbitrarily prescribed elements. We prove that for all sufficiently large extensions , there is an element of prescribed order such that is the relative trace map from onto We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et~al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265–282) completely.classification 11T30, 11G20, 05B15     

An intrinsical description of group codes

A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism which maps G to the standard basis of . Many classical linear codes have been shown to be group codes. In this paper we obtain a criterion to decide when a linear code is a group code in terms of its intrinsical properties in the ambient space , which does not assume an “a priori” group algebra structure on . As an application we provide a family of groups (including metacyclic groups) for which every two-sided group code is an abelian group code. It is well known that Reed–Solomon codes are cyclic and its parity check extensions are elementary abelian group codes. These two classes of codes are included in the class of Cauchy codes. Using our criterion we classify the Cauchy codes of some lengths which are left group codes and the possible group code structures on these codes. Research supported by D.G.I. of Spain and Fundación Séneca of Murcia.     

On self-dual codes over {\mathbb{F}}_5

The purpose of this paper is to improve the upper bounds of the minimum distances of self-dual codes over for lengths [22, 26, 28, 32–40]. In particular, we prove that there is no [22, 11, 9] self-dual code over , whose existence was left open in 1982. We also show that both the Hamming weight enumerator and the Lee weight enumerator of a putative [24, 12, 10] self-dual code over are unique. Using the building-up construction, we show that there are exactly nine inequivalent optimal self-dual [18, 9, 7] codes over up to the monomial equivalence, and construct one new optimal self-dual [20, 10, 8] code over and at least 40 new inequivalent optimal self-dual [22, 11, 8] codes.      

Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check (LDPC) codes defined by (dual) classical generalized quadrangles. We analyze the geometry of the non-singular parabolic quadric in PG(4,q) to find information about the LDPC codes defined by Q (4,q), and . For , and , we are able to describe small weight codewords geometrically. For , q odd, and for , we improve the best known lower bounds on the minimum distance, again only using geometric arguments. Similar results are also presented for the LDPC codes LU(3,q) given in [Kim, (2004) IEEE Trans. Inform. Theory, Vol. 50: 2378–2388]     

Self-dual codes over \mathbb{Z}_8 and \mathbb{Z}_9

We study self-dual codes over the rings and . We define various weights and weight enumerators over these rings and describe the groups of invariants for each weight enumerator over the rings. We examine the torsion codes over these rings to describe the structure of self-dual codes. Finally we classify self-dual codes of small lengths over .     

Efficient <Emphasis Type="Italic">p</Emphasis>th root computations in finite fields of characteristic <Emphasis Type="Italic">p</Emphasis>

We present a method for computing pth roots using a polynomial basis over finite fields of odd characteristic p, p ≥ 5, by taking advantage of a binomial reduction polynomial. For a finite field extension of our method requires p − 1 scalar multiplications of elements in by elements in . In addition, our method requires at most additions in the extension field. In certain cases, these additions are not required. If z is a root of the irreducible reduction polynomial, then the number of terms in the polynomial basis expansion of z ^1/p , defined as the Hamming weight of z ^1/p or , is directly related to the computational cost of the pth root computation. Using trinomials in characteristic 3, Ahmadi et al. (Discrete Appl Math 155:260–270, 2007) give is greater than 1 in nearly all cases. Using a binomial reduction polynomial over odd characteristic p, p ≥ 5, we find always.      

The number of self-dual codes over $${Z_{p^3}}$$

Let p be a prime number. In this paper, we consider codes over the ring of integers modulo p ³ and give a characterization of self-duality. This leads to a construction of self-dual codes and a mass formula, which counts the number of such codes over .      

Lagrangian minimal surfaces in Lorentzian complex plane

Flat Lagrangian minimal surfaces in the Lorentzian complex plane are classified by B. Y. Chen and L. Vrancken in [8]. On the other hand, Vrancken proves in [11] that Lagrangian minimal surfaces of constant curvature in are flat surfaces. In this article, we classify all Lagrangian minimal surfaces in which are free from flat points. Received: 16 December 2007     

Compact Differences of Weighted Composition Operators on Weighted Banach Spaces of Analytic Functions

Let be the weighted Banach space of analytic functions with a topology generated by weighted sup-norm. In the present article, we investigate the analytic mappings and which characterize the compactness of differences of two weighted composition operators on the space . As a consequence we characterize the compactness of differences of composition operators on weighted Bloch spaces.      

Anisotropic version of a theorem of H. Hopf

Given a positive function F on S ² which satisfies a convexity condition, we define a function for surfaces in which is a generalization of the usual mean curvature function. We prove that an immersed topological sphere in with = constant is the Wulff shape, up to translations and homotheties.      

Analytic properties in the spectrum of certain Banach algebras

We show a sufficient condition for a domain in to be a H ^∞-domain of holomorphy. Furthermore if a domain has the Gleason property at a point and the projection of the n − 1th order generalized Shilov boundary does not coincide with Ω then is schlicht. We also give two examples of pseudoconvex domains in which the spectrum is non-schlicht and satisfy several other interesting properties.      

Syzygies of grids of projective lines

In this paper we study the syzygy modules of a grid or a fat grid of . We compute the minimal free resolution for the ideal of a complete grid in , and we conjecture this resolution in . Moreover we compute the minimal free resolution for the ideal of an incomplete grid of . We also conjecture the minimal free resolution for the ideal of a fat complete grid in .      

Quasiperiodic Group Factorizations

If is any ring or semi-ring (e.g., ) and G is a finite abelian group, two elements a, b of the group (semi-)ring are said to form a factorization of G if ab = rΣ _g∈G g for some . A factorization is called quasiperiodic if there is some element g ∈ G of order m > 1 such that either a or b – say b – can be written as a sum b ₀ + ... + b _m−1 of m elements of such that ab _h = g ^h ab ₀ for h = 0, ... , m − 1. Hajós [5] conjectured that all factorizations are quasiperiodic when and r = 1 but Sands [15] found a counterexample for the group . Here we show however that all factorizations of abelian groups are quasiperiodic when and that all factorizations of cyclic groups or of groups of the type are quasiperiodic when . We also give some new examples of non-quasiperiodic factorizations with for the smaller groups and . Received: May 12, 2006. Revised: October 3, 2007.     

Ranks of abelian varieties over infinite extensions of the rationals

Let S be an infinite set of rational primes and, for some p ∈ S, let be the compositum of all extensions unramified outside S of the form , for . If , let be the intersection of the fixed fields by , for i = 1, . . , n. We provide a wide family of elliptic curves such that the rank of is infinite for all n ≥ 0 and all , subject to the parity conjecture. Similarly, let be a polarized abelian variety, let K be a quadratic number field fixed by , let S be an infinite set of primes of and let be the maximal abelian p-elementary extension of K unramified outside primes of K lying over S and dihedral over . We show that, under certain hypotheses, the -corank of sel _p ∞(A/F) is unbounded over finite extensions F/K contained in . As a consequence, we prove a strengthened version of a conjecture of M. Larsen in a large number of cases.     

Maximal partial packings of $${Z_2^n}$$ with perfect codes

A maximal partial Hamming packing of is a family of mutually disjoint translates of Hamming codes of length n, such that any translate of any Hamming code of length n intersects at least one of the translates of Hamming codes in . The number of translates of Hamming codes in is the packing number, and a partial Hamming packing is strictly partial if the family does not constitute a partition of . A simple and useful condition describing when two translates of Hamming codes are disjoint or not disjoint is proved. This condition depends on the dual codes of the corresponding Hamming codes. Partly, by using this condition, it is shown that the packing number p, for any maximal strictly partial Hamming packing of , n = 2 ^m −1, satisfies . It is also proved that for any n equal to 2 ^m −1, , there exist maximal strictly partial Hamming packings of with packing numbers n−10,n−9,n−8,...,n−1. This implies that the upper bound is tight for any n = 2 ^m −1, . All packing numbers for maximal strictly partial Hamming packings of , n = 7 and 15, are found by a computer search. In the case n = 7 the packing number is 5, and in the case n = 15 the possible packing numbers are 5,6,7,...,13 and 14.      

An asymptotic version of Dumnicki’s algorithm for linear systems in $${\mathbb{CP}^2}$$

Using Dumnicki’s approach to showing non-specialty of linear systems consisting of plane curves with prescribed multiplicities in sufficiently general points on we develop an asymptotic method to determine lower bounds for Seshadri constants of general points on . With this method we prove the lower bound for 10 general points on .