q-Rook Polynomials and Matrices over Finite Fields

Connections betweenq-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel'sq-hit polynomial. Both this new statisticmatand another statistic for theq-hit polynomial ξ recently introduced by Dworkin are shown to induce different multiset Mahonian permutation statistics for any Ferrers board. In addition, for the triangular boards they are shown to generate different families of Euler–Mahonian statistics. For these boards the ξ family includes Denert's statisticden, and gives a new proof of Foata and Zeilberger's Theorem that (exc, den) is equidistributed with (des, maj). Thematfamily appears to be new. A proof is also given that theq-hit polynomials are symmetric and unimodal.     

A new extension theorem for linear codes

For an [n,k,d]_q code with k3, gcd(d,q)=1, the diversity of is defined as the pair (Φ₀,Φ₁) with

All the diversities for [n,k,d]_q codes with k3, d−2 (mod q) such that A_i=0 for all i0,−1,−2 (mod q) are found and characterized with their spectra geometrically, which yields that such codes are extendable for all odd q5. Double extendability is also investigated.     

Vanishing Ideals of Projective Spaces over Finite Fields and a Projective Footprint Bound

We consider the vanishing ideal of a projective space over a finite field. An explicit set of generators for this ideal has been given by Mercier and Rolland. We show that these generators form a universal Gr¨obner basis of the ideal. Further we give a projective analogue for the so-called footprint bound, and a version of it that is suitable for estimating the number of rational points of projective algebraic varieties over finite fields. An application to Serre's inequality for the number of points of projective hypersurfaces over finite fields is included.     

Bit-Parallel Arithmetic Implementations over Finite Fields GF(2 m ) with Reconfigurable Hardware

Galois (or finite) fields are used in a wide number of technical applications, playing an important role in several areas such as cryptographic schemes and algebraic codes, used in modern digital communication systems. Finite field arithmetic must be fast, due to the increasing performance needed by communication systems, so it might be necessary for the implementation of the modules performing arithmetic over Galois fields on semiconductor integrated circuits. Galois field multiplication is the most costly arithmetic operation and different approaches can be used. In this paper, the fundamentals of Galois fields are reviewed and multiplication of finite-field elements using three different representation bases are considered. These three multipliers have been implemented using a bit-parallel architecture over reconfigurable hardware and experimental results are presented to compare the performance of these multipliers.