Searcharxiv⌕ Search

arXiv subjects

John Sheekey

Publications and source records attributed to John Sheekey.

At least 37 records · Page 2Linked to original sources
arXiv2019

On the product of elements with prescribed trace

This paper deals with the following problem. Given a finite extension of fields $\mathbb{L}/\mathbb{K}$ and denoting the trace map from $\mathbb{L}$ to $\mathbb{K}$ by $\mathrm{Tr}$, for which elements $z$ in $\mathbb{L}$, and $a$, $b$ in $\mathbb{K}$, is it possible to write $z$ as a product $x\cdot y$, where $x,y\in \mathbb{L}$ with $\mathrm{Tr}(x)=a, \mathrm{Tr}(y)=b$? We solve most of these problems for finite fields, with a complete solution when the degree of the extension is at least $5$. We also have results for arbitrary fields and extensions of degrees $2,3$ or $4$. We then apply our results to the study of PN functions, semifields, irreducible polynomials with prescribed coefficients, and to a problem from finite geometry concerning the existence of certain disjoint linear sets.

math.CO↗
arXiv2019

MRD Codes: Constructions and Connections

This preprint is of a chapter to appear in {\it Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics}, K.-U. Schmidt and A. Winterhof (eds.). Rank-metric codes are codes consisting of matrices with entries in a finite field, with the distance between two matrices being the rank of their difference. Codes with maximum size for a fixed minimum distance are called Maximum Rank Distance (MRD) codes. Such codes were constructed and studied independently by Delsarte (1978), Gabidulin (1985), Roth (1991), and Cooperstein (1998). Rank-metric codes have seen renewed interest in recent years due to their applications in random linear network coding. MRD codes also have interesting connections to other topics such as semifields (finite nonassociative division algebras), finite geometry, linearized polynomials, and cryptography. In this chapter we will survey the known constructions and applications of MRD codes, and present some open problems.

math.CO↗
arXiv2019

Tensor Representation of Rank-Metric Codes

We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a matrix code, and describe the properties of a code through these objects. We define the tensor rank of a code to be the tensor rank of its generating tensors, and propose that this quantity is a significant coding theoretic parameter. By a result on the tensor rank of Kruskal from the 1970s, the tensor rank of a rank-metric code of dimension $k$ and minimum rank distance $d$ is at least $k+d-1$. We call codes that meet this bound minimal tensor rank (MTR) codes. It is known from results in algebraic complexity theory that an MTR code implies the existence of an MDS code. In this paper, we also address the converse problem, that of the existence of an MTR code, given an MDS code. We identify several parameters for which the converse holds and give explicit constructions of MTR codes using MDS codes. We furthermore define generalized tensor ranks, which give a refinement of the tensor rank as a code invariant. Moreover, we use these to distinguish inequivalent rank-metric codes.

cs.IT↗
arXiv2019

A Characterization of the Number of Roots of Linearized and Projective Polynomials in the Field of Coefficients

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive nature. These results follow from our main theorem which characterizes the number of roots using the rank of a matrix that is smaller than the Dickson matrix.

math.NT↗
arXiv2018

Binary additive MRD codes with minimum distance n-1 must contain a semifield spread set

In this paper we prove a result on the structure of the elements of an additive {\it maximum rank distance (MRD) code} over the field of order two, namely that in some cases such codes must contain a semifield spread set. We use this result to classify additive MRD codes in $M_n(\mathbb{F}_2)$ with minimum distance $n-1$ for $n\leq 6$. Furthermore we present a computational classification of additive MRD codes in $M_4(\mathbb{F}_3)$. The computational evidence indicates that MRD codes of minimum distance $n-1$ are much more rare than MRD codes of minimum distance $n$, i.e. semifield spread sets. In all considered cases, each equivalence class has a known algebraic construction.

math.CO↗
arXiv2018

Rank-metric codes, linear sets, and their duality

In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary dimension, giving the connection between two constructions for linear sets defined in [9]. Finally, we then exploit this connection by using the MacWilliams identities to obtain information about the possible weight distribution of a linear set of rank n on a projective line $PG(1, q^n)$.

math.CO↗
arXiv2018

New Semifields and new MRD Codes from Skew Polynomial Rings

In this article we construct a new family of semifields, containing and extending two well-known families, namely Albert's generalised twisted fields and Petit's cyclic semifields (also known as Johnson-Jha semifields). The construction also gives examples of semifields with parameters for which no examples were previously known. In the case of semifields two dimensions over a nucleus and four-dimensional over their centre, the construction gives all possible examples. Furthermore we embed these semifields in a new family of maximum rank-distance codes, encompassing most known current constructions, including the (twisted) Delsarte-Gabidulin codes, and containing new examples for most parameters.

math.CO↗
arXiv2017

Further Generalisations of Twisted Gabidulin Codes

We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes.

cs.IT↗
arXiv2017

A geometric characterisation of Desarguesian spreads

We provide a characterisation of $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$ that have $r$ normal elements in general position. In the same way, we obtain a geometric characterisation of Desarguesian $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$, $r>2$.

math.CO↗
arXiv2016

A new family of linear maximum rank distance codes

In this article we construct a new family of linear maximum rank distance (MRD) codes for all parameters. This family contains the only known family for general parameters, the Gabidulin codes, and contains codes inequivalent to the Gabidulin codes. This family also contains the well-known family of semifields known as Generalised Twisted Fields. We also calculate the automorphism group of these codes, including the automorphism group of the Gabidulin codes.

math.CO↗
arXiv2016

Classification of subspaces in ${\mathbb{F}}^2\otimes {\mathbb{F}}^3$ and orbits in ${\mathbb{F}}^2\otimes {\mathbb{F}}^3\otimes {\mathbb{F}}^r$

This paper contains the classification of the orbits of elements of the tensor product spaces ${\mathbb{F}}^2\otimes {\mathbb{F}}^3 \otimes{\mathbb{F}}^r$, $r\geq 1$, under the action of two natural groups, for all finite; real; and algebraically closed fields. For each of the orbits we determine: a canonical form; the tensor rank; the rank distribution of the contraction spaces; and a geometric description. The proof is based on the study of the contraction spaces in ${\mathrm{PG}}({\mathbb{F}}^2\otimes{\mathbb{F}}^3)$ and is geometric in nature. Although the main focus is on finite fields, the techniques are mostly field independent.

math.CO↗
arXiv2016

The BEL-rank of finite semifields

In this article we introduce the notion of the BEL-rank of a finite semifield, prove that it is an invariant for the isotopism classes, and give geometric and algebraic interpretations of this new invariant. Moreover, we describe an efficient method for calculating the BEL-rank, and present computational results for all known small semifields.

math.CO↗
arXiv2015

Canonical forms of $2\times 3 \times 3$ tensors over the real field, algebraically closed fields, and finite fields

We classify the orbits of elements of the tensor product spaces ${\mathbb{F}}^2\otimes {\mathbb{F}}^3 \otimes {\mathbb{F}}^3$ for all finite; real; and algebraically closed fields under the action of two natural groups. The result can also be interpreted as the classification of the orbits in the $17$-dimensional projective space of the Segre variety product of a projective line and two projective planes. This extends the classification of the orbits in the $7$-dimensional projective space of the Segre variety product of three projective lines [M. Lavrauw and J. Sheekey: Orbits of the stabiliser group of the Segre variety product of three projective lines, Finite Fields Appl. (2014)]. The proof is geometric in nature, relies on properties of the Segre embedding, and uses the terminology of projective spaces.

math.CO↗
arXiv2014

Subgeometries in the André/Bruck-Bose representation

We consider the André/Bruck-Bose representation of the projective plane $\mathrm{PG}(2,q^n)$ in $\mathrm{PG}(2n,q)$. We investigate the representation of $\mathbb{F}_{q^k}$-sublines and $\mathbb{F}_{q^k}$-subplanes of $\mathrm{PG}(2,q^n)$, extending the results for $n=3$ of \cite{BarJack2} and correcting the general result of \cite{BarJack1}. We characterise the representation of $\mathbb{F}_{q^k}$-sublines tangent to or contained in the line at infinity, $\mathbb{F}_q$-sublines external to the line at infinity, $\mathbb{F}_q$-subplanes tangent to and $\mathbb{F}_{q^k}$-subplanes secant to the line at infinity.

math.CO↗
arXiv2014

On BEL-configurations and finite semifields

The BEL-construction for finite semifields was introduced in \cite{BEL2007}; a geometric method for constructing semifield spreads, using so-called BEL-configurations in $V(rn,q)$. In this paper we investigate this construction in greater detail, and determine an explicit multiplication for the semifield associated with a BEL-configuration in $V(rn,q)$, extending the results from \cite{BEL2007}, where this was obtained only for $r=n$. Given a BEL-configuration with associated semifields spread $\mathcal{S}$, we also show how to find a BEL-configuration corresponding to the dual spread $\mathcal{S}^d$. Furthermore, we study the effect of polarities in $V(rn,q)$ on BEL-configurations, leading to a characterisation of BEL-configurations associated to symplectic semifields. We give precise conditions for when two BEL-configurations in $V(n^2,q)$ define isotopic semifields. We define operations which preserve the BEL property, and show how non-isotopic semifields can be equivalent under this operation. We also define an extension of the ```switching'' operation on BEL-configurations in $V(2n,q)$ introduced in \cite{BEL2007}, which, together with the transpose operation, leads to a group of order $8$ acting on BEL-configurations.

math.CO↗
arXiv2013

Constant rank-distance sets of hermitian matrices and partial spreads in hermitian polar spaces

In this paper we investigate partial spreads of $H(2n-1,q^2)$ through the related notion of partial spread sets of hermitian matrices, and the more general notion of constant rank-distance sets. We prove a tight upper bound on the maximum size of a linear constant rank-distance set of hermitian matrices over finite fields, and as a consequence prove the maximality of extensions of symplectic semifield spreads as partial spreads of $H(2n-1,q^2)$. We prove upper bounds for constant rank-distance sets for even rank, construct large examples of these, and construct maximal partial spreads of $H(3,q^2)$ for a range of sizes.

math.CO↗