Existence of New Extremal Doubly-Even Codes and Extremal Singly-Even Codes

Recently the author and Kimura have considered a construction of doubly-even codes from a given doubly-even code. In this note, we show that the restricutoion of doubly-even can be removed in the above construction. As an application, at least 137 inequivalent extremal doubly-even [56,28,12] codes and at least 1000 inequivalent extremal doubly-even [40,20,8] codes are constructed from known self-dual codes. The existence of new extremal singly-even codes is also described.     

New Extremal Type II Codes Over ℤ4

Recently Type II codes over ℤ₄ have been introduced as self-dual codes containing the all-one vector with the property that all Euclidean weights are divisible by eight. The notion of extremality for the Euclidean weight has been also given. In this paper, we give two methods for constructing Type II codes over ℤ₄. By these methods, new extremal Type II codes of lengths 16, 24, 32 and 40 are constructed from weighing matrices.     

Bezoutians, Euclidean Algorithm, and Orthogonal Polynomials

We prove a quadratic expression for the Bezoutian of two univariate polynomials in terms of the remainders for the Euclidean algorithm. In case of two polynomials of the same degree, or of consecutive degrees, this allows us to interpret their Bezoutian as the Christoffel- Darboux kernel for a finite family of orthogonal polynomials, arising from the Euclidean algorithm. We give orthogonality properties of remainders, and reproducing properties of Bezoutians. Received December 13, 2004     

On Z4-Linear Goethals Codes and Kloosterman Sums

Studying the coset weight distributions of the Z₄-linear Goethals codes, e connect these codes with the Kloosterman sums. From one side, e obtain for some cases, of the cosets of weight four, the exact expressions for the number of code ords of weight four in terms of the Kloosterman sums. From the other side, e obtain some limitations for the possible values of the Kloosterman sums, hich improve the well known results due to Lachaud and Wolfmann kn:lac.     

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.     

Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes

In this paper it is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circulant self-dual code and its shadow through a relationship between bordered and pure double circulant codes. As applications, a restriction on the weight enumerators of some extremal double circulant codes is determined and a uniqueness proof of extremal double circulant self-dual codes of length 46 is given. New extremal singly-even [44,22,8] double circulant codes are constructed. These codes have weight enumerators for which extremal codes were not previously known to exist.     

Z4线性码的广义Mac Williams恒等式

本文讨论了Z4线性码的支集重量分布,并对类型为4^k1的Z4线性码,给出了联系它与对偶码的支集重量分布之间的广义MacWilliams恒等式。     

Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes

In this paper, we are concerned about optimal (v, 4, 3, 2)‐OOCs. A tight upper bound on the exact number of codewords of optimal (v, 4, 3, 2)‐OOCs and some direct and recursive constructions of optimal (v, 4, 3, 2)‐OOCs are given. As a result, the exact number of codewords of an optimal (v, 4, 3, 2)‐OOC is determined for some infinite series.     

Orthogonal surfaces with constant mean curvature in the Euclidean 4-space

We classify orthogonal surfaces ofE ⁴ whose mean curvature is constant by proving that they are either of 1-type or of 2-type.Partially supported by a ME/Fulbright grant and by a DGICYT grant PB91-0705-C02-01     

New Extremal Type I Codes of Lengths 40, 42, and 44

It is known that it is possible to construct a generator matrix for a self-dual code of length 2n+2 from a generator matrix of a self-dual code of length 2n. With the aid of a computer, we construct new extremal Type I codes of lengths 40, 42, and 44 from extremal self-dual codes of lengths 38, 40, and 42 respectively. Among them are seven extremal Type I codes of length 44 whose weight enumerator is 1+224y ⁸+872y ¹⁰+·. A Type I code of length 44 with this weight enumerator was not known to exist previously.     

Trellis Structure and Higher Weights of Extremal Self-Dual Codes

A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and corresponding permutations are known for relatively few codes.The task of finding such permutations is shown to be substantially simplifiable in the case of self-dual codes in general, and for self-dual codes of sufficiently high minimum distance it is shown that it is frequently possible to deduce the existence of these permutations directly from the parameters of the code.A new and tighter link between generalized Hamming weights and trellis representations is demonstrated: for some self-dual codes, knowledge of one of the generalized Hamming weights is sufficient to determine the entire optimal state complexity profile.These results are used to characterize the permutation-optimal trellises and generalized Hamming weights for all [32,16,8] binary self-dual codes and for several other codes. The numbers of uniformly efficient permutations for several codes, including the [24,12,8] Golay code and both [24,12,9] ternary self-dual codes, are found.     

Extremal property of some surfaces in n-dimensional Euclidean space

A surface Γ=(f ₁(X₁,..., x_m),...,f _n(x₁,..., x_m)) is said to be extremal if for almost all points of Γ the inequality $$\parallel a_1 f_1 (x_1 , \ldots ,x_m ) + \ldots + a_n f_n (x_1 , \ldots ,x_m )\parallel< H^{ - n - \varepsilon } ,$$ , where H=max(¦a _i¦) (i=1, 2, ..., n), has only a finite number of solutions in the integersa ₁, ...,a _n. In this note we prove, for a specific relationship between m and n and a functional condition on the functionsf ₁, ...,f _n, the extremality of a class of surfaces in n-dimensional Euclidean space.     

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.     

Extremal eigenvalues of the Laplacian on Euclidean domains and closed surfaces

We investigate properties of the sequences of extremal values that could be achieved by the eigenvalues of the Laplacian on Euclidean domains of unit volume, under Dirichlet and Neumann boundary conditions, respectively. In a second part, we study sequences of extremal eigenvalues of the Laplace–Beltrami operator on closed surfaces of unit area.     

Extremal Even Unimodular Lattices of Rank 32 and Related Codes

In the paper the asymptotic behaviour of the solutions of a class of neutral differential equations with distributed delay is studied.     

Euclidean Distance Between Haar Orthogonal and Gaussian Matrices

In this work, we study a version of the general question of how well a Haar-distributed orthogonal matrix can be approximated by a random Gaussian matrix. Here, we consider a Gaussian random matrix \(Y_n\) of order n and apply to it the Gram–Schmidt orthonormalization procedure by columns to obtain a Haar-distributed orthogonal matrix \(U_n\). If \(F_i^m\) denotes the vector formed by the first m-coordinates of the ith row of \(Y_n-\sqrt{n}U_n\) and \(\alpha \,=\,\frac{m}{n}\), our main result shows that the Euclidean norm of \(F_i^m\) converges exponentially fast to \(\sqrt{ \big (2-\frac{4}{3} \frac{(1-(1 -\alpha )^{3/2})}{\alpha }\big )m}\), up to negligible terms. To show the extent of this result, we use it to study the convergence of the supremum norm \(\epsilon _n(m)\,=\,\sup _{1\le i \le n, 1\le j \le m} |y_{i,j}- \sqrt{n}u_{i,j}|\) and we find a coupling that improves by a factor \(\sqrt{2}\) the recently proved best known upper bound on \(\epsilon _n(m)\). Our main result also has applications in Quantum Information Theory.     

最优(v,{3,4},1,Q)-光正交码的构造

在光纤码分多址(OCDMA)系统中,变重量光正交码被广泛使用,以满足多种服务质量的需求.利用分圆类和斜starter给出了直接构造方法,借助有关循环差阵的递归构造方法,从而构造了两类循环填充设计.通过建立循环填充设计与变重量光正交码之间的联系,证明了当Q∈{{2/3,1/3},{3/4,1/4}}时,最优(v,{3,4},1,Q)-光正交码存在的无穷类.     

Maximal Subgroups of Finite Orthogonal Groups Stabilizing Spreads of Lines

We prove that, for q odd and n ≥ 3, the group G = O _n (q ²) · 2 is maximal in either the orthogonal group O _2n (q) or the special orthogonal group SO _2n (q). The group G corresponds to the stabilizer of a spread of lines of PG(2n ? 1, q) in which some lines lie on a quadric, some are secant to the quadric, and others are external to the quadric.