Finite Fields and Their Applications最新文献

A complete partition of a graph G is a partition of the vertex set such that there is at least one edge between any two parts. The largest r such that G has a complete partition into r parts, each of which is an independent set, is the achromatic number of G. We determine the achromatic number of polarity graphs of biaffine planes coming from generalized polygons. Our colorings of a family of unitary polarity graphs are used to solve a problem of Axenovich and Martin on complete partitions of $C_4$-free graphs. Furthermore, these colorings prove that there are sequences of graphs which are optimally complete and have unbounded degree, a problem that had been studied for the sequence of hypercubes independently by Roichman, and Ahlswede, Bezrukov, Blokhuis, Metsch, and Moorhouse.

APN functions play a big role as primitives in symmetric cryptography as building blocks that yield optimal resistance to differential attacks. In this note, we consider a recent extension, done by Calderini et al. (2023), of a biprojective APN family introduced by Göloğlu (2022) defined on $F_{2^{2m}}$. We show that this generalization yields functions equivalent to Göloğlu's original family if $3\nmid m$. If $3|m$ we show exactly how many inequivalent APN functions this new family contains. We also show that the family has the minimal image set size for an APN function and determine its Walsh spectrum, hereby settling some open problems. In our proofs, we leverage a group theoretic technique recently developed by Göloğlu and the author in conjunction with a group action on the set of projective polynomials.

For an ${[n,k,d]}_q$ linear code $C$, the singleton defect of $C$ is defined by $S\left(C\right)=n-k+1-d$. When $S\left(C\right)=S\left(C^{\perp }\right)=1$, the code $C$ is called a near maximum distance separable (NMDS) code, where $C^{\perp }$ is the dual code of $C$. NMDS codes have important applications in finite projective geometries, designs and secret sharing schemes. In this paper, we present four new constructions of infinite families of NMDS codes with dimension 4 and completely determine their weight enumerators. As an application, we also determine the locality of the dual codes of these NMDS codes and obtain four families of distance-optimal and dimension-optimal locally recoverable codes.

In this paper we compute the automorphism group of the curves $X_{a,b,n,s}$ and $Y_{n,s}$ introduced in Tafazolian et al. [27] as new examples of maximal curves which cannot be covered by the Hermitian curve. They arise as subcovers of the first generalized GK curve (GGS curve). As a result, a new characterization of the GK curve, as a member of this family, is obtained.

Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise from a subfield. In this paper, we investigate the existence of a clique of size $\sqrt{q}$ with a subspace structure in pseudo-Paley graphs of order q from unions of semi-primitive cyclotomic classes. We show that such a clique must have an equal contribution from each cyclotomic class and that most such pseudo-Paley graphs do not admit such cliques, suggesting that the Delsarte bound $\sqrt{q}$ on the clique number can be improved in general. We also prove that generalized Peisert graphs are not isomorphic to Paley graphs or Peisert graphs, confirming a conjecture of Mullin.

It is known that a Bruen chain of the three-dimensional projective space $\mathrm{PG}(3,q)$ exists for every odd prime power q at most 37, except for $q=29$. It was shown by Cardinali et al. (2005) that Bruen chains do not exist for $41⩽q⩽49$. We develop a model, based on finite fields, which allows us to extend this result to $41⩽q⩽97$, thereby adding more evidence to the conjecture that Bruen chains do not exist for $q>37$. Furthermore, we show that Bruen chains can be realised precisely as the $(q+1)/2$-cliques of a two related, yet distinct, undirected simple graphs.

A complete complementary code (CCC) consists of M sequence sets with size M. The sum of the auto-correlation functions of each sequence set is an impulse function, and the sum of cross-correlation functions of the different sequence sets is equal to zero. Thanks to their excellent correlation, CCCs received extensive use in engineering. In addition, they are strongly connected to orthogonal matrices. In some application scenarios, additional requirements are made for CCCs, such as recently proposed for concatenative CCC (CCCC) division multiple access (CCC-CDMA) technologies. In fact, CCCCs are a special kind of CCCs which requires that each sequence set in CCC be concatenated to form a zero-correlation-zone (ZCZ) sequence set. However, this requirement is challenging, and the literature is thin since there is only one construction in this context. We propose to go beyond the literature through this contribution to reduce the gap between their interest and our limited knowledge of CCCCs. This paper will employ novel methods for designing CCCCs and precisely derive two constructions of these objects. The first is based on perfect cross Z-complementary pair and Hadamard matrices, and the second relies on extended Boolean functions. Specifically, we highlight that optimal and asymptotic optimal CCCCs could be obtained through the proposed constructions. Besides, we shall present a comparison analysis with former structures in the literature and examples to illustrate our main results.

The classification of the 2-designs with $\lambda =2$ admitting a flag-transitive automorphism groups with socle $PSL(2,q)$ is completed by settling the two open cases in [2]. The result is achieved by using conics and hyperovals of $PG(2,q)$.

In this paper, we generalize [6], [1], [5] and [3] by allowing the distance between two points in a finite field vector space to be defined by a general non-degenerate bilinear form or quadratic form. We prove the same bounds on the sizes of large subsets of $F_q^d$ for them to contain distance graphs with a given maximal vertex degree, under the more general notion of distance. We also prove the same results for embedding paths, trees and cycles in the general setting.

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain algorithms for elliptic curves with complex multiplication by imaginary quadratic field of class numbers one and two, but, they were not able to obtain primality proving algorithms in cases of higher class number. In this paper, we present a method to apply their framework to imaginary quadratic fields of class number three. In particular, our method provides a more efficient primality proving algorithm for special sequences of integers than the existing algorithms by using an imaginary quadratic field of class number three in which 2 splits. As an application, we give two special sequences of integers derived from $Q\left(\sqrt{-23}\right)$ and $Q\left(\sqrt{-31}\right)$, which are all the imaginary quadratic fields of class number three in which 2 splits. Finally, we give a computational result for the primality of these sequences.