Related papers: Designs over finite fields by difference methods

The generalized chain geometry over the local ring $K(\epsilon;\sigma)$ of twisted dual numbers, where $K$ is a finite field, is interpreted as a divisible design obtained from an imprimitive group action. Its combinatorial properties as…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…

The multiplicative group of a finite field is well known to be cyclic; in this note, we determine the finite fields whose multiplicative groups are direct sum indecomposable. We obtain our classification using a direct argument and also as…

We consider indecomposable representations of the Klein four group over a field of characteristic $2$ and of a cyclic group of order $pm$ with $p,m$ coprime over a field of characteristic $p$. For each representation we explicitly describe…

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

A celebrated theorem of P.M.Cohn says that for any two division rings (not necessarily finite dimensional) over a field F, their amalgamated product over F is a domain which can be embedded in a division ring. Note that even with the two…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…

We show that for every positive integer $n$ there exists a simple group that is of type $\mathrm{F}_{n-1}$ but not of type $\mathrm{F}_n$. For $n\ge 3$ these groups are the first known examples of this kind. They also provide infinitely…

The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…

We use Totaro's examples of non-semiample nef line bundles on smooth projective surfaces over finite fields to construct nef line bundles for which the first cohomology group cannot be killed by any generically finite covers. This is used…

To each supersimple $2-(n,4,\lambda)$ design $\mathcal{D}$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $\mathbb{P}_3$.…

Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…

Let $\mathbb{F}_q$ be a finite field of cardinality $q$, where $q$ is a power of a prime number $p$, $t\geq 2$ an even number satisfying $t \not\equiv 1 \;(\bmod \;p)$ and $\mathbb{F}_{q^t}$ an extension field of $\mathbb{F}_q$ with degree…

We consider when the projective special linear group over a finite field defines a $3$-design with a cyclic starter block. We will show that the equivalences of the existence of such $3$-$(q+1,5,3)$ and $3$-$(q+1,10,18)$ designs for a prime…

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we use the method developed before to solve one more special case. We make extensive use of standard…

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…

Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group $G$ are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct…