The dual geometry of Hermitian two-point codes

In this paper, we study the algebraic geometry of any two-point code on the Hermitian curve and reveal the purely geometric nature of their dual minimum distance. We describe the minimum-weight codewords of many of their dual codes through an explicit geometric characterization of their supports. In particular, we show that they appear as sets of collinear points in many cases.     

Symmetric complete intersections

We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these ideals and describe formulas for the graded characters of the corresponding quotient rings.     

LDPC codes from the Hermitian curve

In this paper, we study the code which has as parity check matrix the incidence matrix of the design of the Hermitian curve and its (q + 1)-secants. This code is known to have good performance with an iterative decoding algorithm, as shown by Johnson and Weller in (Proceedings at the ICEE Globe com conference, Sanfrancisco, CA, 2003). We shall prove that has a double cyclic structure and that by shortening in a suitable way it is possible to obtain new codes which have higher code-rate. We shall also present a simple way to constructing the matrix via a geometric approach.      

Topology of complete intersections

Let X _n (d) and X _n (d') be two n-dimensional complete intersections with the same total degree d. In this paper we prove that, if n is even and d has no prime factors less than , then X _n (d) and X _n (d') are homotopy equivalent if and only if they have the same Euler characteristics and signatures. This confirms a conjecture of Libgober and Wood [16]. Furthermore, we prove that, if d has no prime factors less than , then X _n (d) and X _n (d') are homeomorphic if and only if their Pontryagin classes and Euler characteristics agree. Received: September 6, 1996     

Structure of functional codes defined on non-degenerate Hermitian varieties

We study the functional codes of order h defined by G. Lachaud on a non-degenerate Hermitian variety, by exhibiting a result on divisibility for all the weights of such codes. In the case where the functional code is defined by evaluating quadratic functions on the non-degenerate Hermitian surface, we list the first five weights, describe the geometrical structure of the corresponding quadrics and give a positive answer to a conjecture formulated on this question by Edoukou (2009) [8]. The paper ends with two conjectures. The first is about the divisibility of the weights in the functional codes. The second is about the minimum distance and the distribution of the codewords of the first 2h+1 weights.     

Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices

We define the notion of an orbit matrix with respect to standard weighing matrices, and with respect to types of weighing matrices with entries in a finite field. In the latter case we primarily restrict our attention the fields of order 2, 3 and 4. We construct self-orthogonal and Hermitian self-orthogonal linear codes over finite fields from these types of weighing matrices and their orbit matrices respectively. We demonstrate that this approach applies to several combinatorial structures such as Hadamard matrices and balanced generalized weighing matrices. As a case study we construct self-orthogonal codes from some weighing matrices belonging to some well known infinite families, such as the Paley conference matrices, and weighing matrices constructed from ternary periodic Golay pairs.     

A construction of Gray codes inducing complete graphs

A binary Gray code G(n) of length n, is a list of all 2ⁿn-bit codewords such that successive codewords differ in only one bit position. The sequence of bit positions where the single change occurs when going to the next codeword in G(n), denoted by S(n)?s₁,s₂,…,s_2ⁿ-1, is called the transition sequence of the Gray code G(n). The graph G_G(n) induced by a Gray code G(n) has vertex set {1,2,…,n} and edge set {{s_i,s_i+1}:1?i?2ⁿ-2}. If the first and the last codeword differ only in position s_2ⁿ, the code is cyclic and we extend the graph by two more edges {s_2ⁿ-1,s_2ⁿ} and {s_2ⁿ,s₁}. We solve a problem of Wilmer and Ernst [Graphs induced by Gray codes, Discrete Math. 257 (2002) 585-598] about a construction of an n-bit Gray code inducing the complete graph K_n. The technique used to solve this problem is based on a Gray code construction due to Bakos [A. Ádám, Truth Functions and the Problem of their Realization by Two-Terminal Graphs, Akadémiai Kiadó, Budapest, 1968], and which is presented in D.E. Knuth [The Art of Computer Programming, vol. 4, Addison-Wesley as part of “fascicle” 2, USA, 2005].     

On modules of finite projective dimension over complete intersections

Recently Avramov and Miller proved that over a local complete intersection ring in characteristic 0$">, a finitely generated module has finite projective dimension if for some 0$"> and for some 0$">, being the frobenius map repeated times. They used the notion of ``complexity' and several related theorems. Here we offer a very simple proof of the above theorem without using ``complexity' at all.

     

The second generalized Hamming weight for two-point codes on a Hermitian curve

The aim of this article is the determination of the second generalized Hamming weight of any two-point code on a Hermitian curve of degree q + 1. The determination involves results of Coppens on base-point-free pencils on a plane curve. To avoid non- essential trouble, we assume that q > 4.      

Elliptic genera of level N for complete intersections

We focus on the elliptic genera of level N at the cusps of a congruence subgroup for any complete intersection. Writing the first Chern class of a complete intersection as a product of an integral coefficient c₁ and a generator of the 2nd integral cohomology group, we mainly discuss the values of the elliptic genera of level N for the complete intersection in the cases of c₁>, =, or<0, In particular, the values about the Todd genus, \widehat{A}\mathrm{-genus}, and A_k-genus can be derived from the elliptic genera of level N.     

Hermitian-Poisson Metrics on Flat Bundles over Complete Hermitian Manifolds

In this paper, the author solves the Dirichlet problem for Hermitian-Poisson metric equation √?1Λ_ωG_H = λId and proves the existence of Hermitian-Poisson metrics on flat bundles over a class of complete Hermitian manifolds. When λ = 0, the HermitianPoisson metric is a Hermitian harmonic metric.     

Characterization of modules of finite projective dimension over complete intersections

Let be a finitely generated module over a local complete intersection of characteristic . The property that has finite projective dimension can be characterized by the vanishing of for some and for some .