On self-dual normal bases

We deal with the existence of self-dual normal basis for Galois extensions of a commutative ring. We consider commutative rings which are local, connected semi-local (under some suitable restrictions) or zero-dimensional. We show that for such kind of rings every Galois extension of odd degree has a self-dual normal basis.     

Irredundant self-dual bases for self-dual lattice varieties

For any finitely based self-dual variety of lattices, we determine the sizes of all equational bases that are both irredundant and self-dual. We make the same determination for {0, 1}-lattice varieties.Received July 11, 2002; accepted in final form August 27, 2004.     

Enumerating bases of self-dual matroids

We define involutively self-dual matroids and prove that an enumerator for their bases is the square of a related enumerator for their self-dual bases. This leads to a new proof of Tutte's theorem that the number of spanning trees of a central reflex is a perfect square, and it solves a problem posed by Kalai about higher dimensional spanning trees in simplicial complexes. We also give a weighted version of the latter result.We give an algebraic analogue relating to the critical group of a graph, a finite abelian group whose order is the number of spanning trees of the graph. We prove that the critical group of a central reflex is a direct sum of two copies of an abelian group, and conclude with an analogous result in Kalai's setting.     

The trace of an optimal normal element and low complexity normal bases

Let ${\mathbb{F}}_{q}$ be a finite field and consider an extension ${\mathbb{F}}_{q^{n}}$ where an optimal normal element exists. Using the trace of an optimal normal element in ${\mathbb{F}}_{q^{n}}$ , we provide low complexity normal elements in ${\mathbb{F}}_{q^{m}}$ , with m = n/k. We give theorems for Type I and Type II optimal normal elements. When Type I normal elements are used with m = n/2, m odd and q even, our construction gives Type II optimal normal elements in ${\mathbb{F}}_{q^{m}}$ ; otherwise we give low complexity normal elements. Since optimal normal elements do not exist for every extension degree m of every finite field ${\mathbb{F}}_{q}$ , our results could have a practical impact in expanding the available extension degrees for fast arithmetic using normal bases.     

Gauss periods as constructions of low complexity normal bases

Optimal normal bases are special cases of the so-called Gauss periods (Disquisitiones Arithmeticae, Articles 343–366); in particular, optimal normal bases are Gauss periods of type (n, 1) for any characteristic and of type (n, 2) for characteristic 2. We present the multiplication tables and complexities of Gauss periods of type (n, t) for all n and t = 3, 4, 5 over any finite field and give a slightly weaker result for Gauss periods of type (n, 6). In addition, we give some general results on the so-called cyclotomic numbers, which are intimately related to the structure of Gauss periods. We also present the general form of a normal basis obtained by the trace of any normal basis in a finite extension field. Then, as an application of the trace construction, we give upper bounds on the complexity of the trace of a Gauss period of type (n, 3).     

Explicit construction of self-dual integral normal bases for the square-root of the inverse different

Let K be a finite extension of Qp, let L/K be a finite abelian Galois extension of odd degree and let OL be the valuation ring of L. We define AL/K to be the unique fractional OL-ideal with square equal to the inverse different of L/K. For p an odd prime and L/Qp contained in certain cyclotomic extensions, Erez has described integral normal bases for AL/Qp that are self-dual with respect to the trace form. Assuming K/Qp to be unramified we generate odd abelian weakly ramified extensions of K using Lubin-Tate formal groups. We then use Dwork's exponential power series to explicitly construct self-dual integral normal bases for the square-root of the inverse different in these extensions.     

Construction of quasi-cyclic self-dual codes

There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field ${\mathbb{F}}_q$ and linear codes over a ring $R={\mathbb{F}}_q[Y]/(Y^m?1)$. Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field ${\mathbb{F}}_q$ can be obtained by the building-up construction, provided that $\mathrm{char}({\mathbb{F}}_q)=2$ or $q\equiv 1(\mathrm{mod}4)$, m is a prime p, and q is a primitive element of ${\mathbb{F}}_p$. We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths $30,36,42,48$ (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When $m=5$, we obtain a new 8-quasi-cyclic self-dual $[40,20,12]$ code over ${\mathbb{F}}_3$ and a new 6-quasi-cyclic self-dual $[30,15,10]$ code over ${\mathbb{F}}_4$. When $m=7$, we find a new 4-quasi-cyclic self-dual $[28,14,9]$ code over ${\mathbb{F}}_4$ and a new 6-quasi-cyclic self-dual $[42,21,12]$ code over ${\mathbb{F}}_4$.     

Optimal normal bases

Let K L be a finite Galois extension of fields, of degree n. Let G be the Galois group, and let (<) _{be a normal basis for L over K. An argument due to Mullin, Onyszchuk, Vanstone and Wilson (Discrete Appl. Math. 22 (1988/89), 149–161) shows that the matrix that describes the map x x on this basis has at least 2n - 1 nonzero entries. If it contains exactly 2n - 1 nonzero entries, then the normal basis is said to be optimal. In the present paper we determine all optimal normal bases. In the case that K is finite our result confirms a conjecture that was made by Mullin et al. on the basis of a computer search.}     

Self-dual normal bases

Every Galois extension of odd degree has a self-dual normal basis.     

Ideals with bases of unbounded Borel complexity

We present several naturally defined σ‐ideals which have Borel bases but, unlike for the classical examples, these ideals are not of bounded Borel complexity. We investigate set‐theoretic properties of such σ‐ideals.     

Surfaces in self-dual Einstein manifolds and their twistor lifts

In this note, we consider surfaces in self-dual Einstein manifolds whose twistor lifts are harmonic sections. In particular, we state the stability of the twistor lifts as harmonic sections and determine such surfaces of genus zero. This paper is a short survey of our previous results in Hasegawa (2007, 2009, 2011) [9], [10], [11].     

Construction of MDS self-dual codes over Galois rings

The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of (Kim and Lee, J Combin Theory ser A, 105:79–95). We give a necessary and sufficient condition on which the building-up construction holds. We construct MDS self-dual codes of lengths up to 8 over GR(3²,2), GR(3³,2) and GR(3⁴,2), and near-MDS self-dual codes of length 10 over these rings. In a similar manner, over GR(5²,2), GR(5³,2) and GR(7²,2), we construct MDS self-dual codes of lengths up to 10 and near-MDS self-dual codes of length 12. Furthermore, over GR(11²,2) we have MDS self-dual codes of lengths up to 12.      

Construction of long MDS self-dual codes from short codes

In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed.     

On k-dimensional graphs and their bases

Periodica Mathematica Hungarica -     

Construction of normal bases of rings of integral elements of certain fields of algebraic functions

This article is devoted to the construction of normal bases of rings of integral elements of certain fields of algebraic functions. These fields are algebraic extensions of the initial fields, given by appropriate algebraic equations. The extensions are given only by the monodromy group. The device of the matrix Riemann boundary-value problem on a Riemann surface is used.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 7, pp. 1004–1007, July, 1990.     

Construction and complexity of hierarchical matrices

In previous papers a class of ℋ︁‐matrices was introduced which are data‐sparse and allow an approximate matrix arithmetic of nearly optimal complexity. The complexity analysis for the (approximate) matrix arithmetics in the class of ℋ︁‐matrices is based on two criteria, the sparsity and the idempotency. We describe a general strategy for the construction of the ℋ︁‐matrices where the two criteria are fulfilled.     

Construction of orthogonal multiwavelet bases

We propose a method for constructing orthogonal multiwavelet bases of the space L ²(?) for any known multiscaling functions that generate a multiresolution analysis of dimension greater than 1.