Related papers: A projection construction for semifields

The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semifields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187--196]. We…

In this article, we present two new constructions for semifields of order $p^{2m}$. Together, the constructions unify and generalize around a dozen distinct semifield constructions, including both the oldest known construction by Dickson…

We apply the semidefinite programming method to derive bounds for projective codes over a finite field.

This paper gives a systematic construction of certain covers of finite semigroups. These covers will be used in future work on the complexity of finite semigroups.

In this paper we collect and improve the techniques for calculating the nuclei of a semifield and we use these tools to determine the order of the nuclei and of the center of some commutative presemifields of odd characteristic recently…

In this note, we extend the quasi-projective dimension of finite (that is, finitely generated) modules to homologically finite complexes, and we investigate some of homological properties of this dimension.

In this paper we study the problem of constructing non-trivial subtowers and supertowers of recursive towers of function fields over finite fields.

We characterize the semiclosed projections and apply them to compute the Schur complement of a selfadjoint operator with respect to a closed subspace. These projections occur naturally when dealing with weak complementability.

In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.

A finite semifield is a finite nonassociative ring with identity such that the set of its nonzero elements is closed under the product. From any finite semifield a projective plane can be constructed. In this paper we obtain new semifield…

Semi-entwining structures are proposed as concepts simpler than entwining structures, yet they are shown to have interesting applications in constructing intertwining operators and braided algebras, lifting functors, finding solutions for…

The goal of this paper is to provide some basic structure information on derivations in finite semirings.

We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

Finite field transforms have many applications and, in many cases, can be implemented with a low computational complexity. In this paper, the Z Transform over a finite field is introduced and some of its properties are presented.

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

It is pointed out that despite of the non-linearity of the underlying equations, there do exist rather general methods that allow to generate new minimal surfaces from known ones.

Finite projective planes are constructed using groups that satisfy simple-looking conditions. The resulting projective planes include many known planes and possibly new ones, and are precisely those having a collineation group fixing a flag…

We construct a random $n$-hypergraph for every $n$, in a given pseudofinite field.