A Construction of Cartesian Authentication Codes from Vector Space over Finite Field

In this paper, two new constructions of Cartesian authentication codes from symplectic geometry are presented and their size parameters are computed.

Generalized incidence theorems, homogeneous forms and sum–product estimates in finite fields

We propose a construction of full-rank q-ary 1-perfect codes. This is a generalization of the construction of full-rank binary 1-perfect codes by Etzion and Vardy (1994). The properties of the i-components of q-ary Hamming codes are investigated, and the construction of full-rank q-ary 1-perfect codes is based on these properties. The switching construction of 1-perfect codes is generalized to the q-ary case. We propose a generalization of the notion of an i-component of a 1-perfect code and introduce the concept of an (i, σ)-component of a q-ary 1-perfect code. We also present a generalization of the Lindström–Schönheim construction of q-ary 1-perfect codes and provide a lower bound for the number of pairwise distinct q-ary 1-perfect codes of length n.

In this paper, we introduce a nonzero component graph of a finite-dimensional near-vector space constructed from a finite field. We investigate the relationship between the existence of a basis of a near-vector space over a field with that of the vector space over the same field, with the same dimension. We introduce the notion of a coordinate vector and prove an equivalent formulation for the definition of the nonzero component graph. We show that despite the vast differences in the structure of a near-vector space compared with a vector space, especially in the nonregular case, the graph fails the recognition problem in that it cannot distinguish between the near-vector space and its associated vector space. Thus, we show that the nonzero component graph of a near-vector space is identical to the one for a vector space over the same field, of the same dimension. Leveraging this result, we completely characterise and describe graph properties for the nonzero component graph on both near-vector spaces and vector spaces by partitioning the graph into components using the regularity graph of any nonregular near-vector space (with the same dimension) with its nonzero component graph. In closing we provide a reconstruction algorithm for constructing a near-vector space for a given nonzero component graph, satisfying certain conditions.

The first purpose of this paper is to provide new finite field extension theorems for paraboloids and spheres. By using the unusual good Fourier transform of the zero sphere in some specific dimensions, which has been discovered recently in the work of Iosevich, Lee, Shen, and the first and second listed authors (2018), we provide new L2→Lr extension estimates for paraboloids in certain odd dimensions with −1 non-square, which improves significantly the recent exponent obtained by the first listed author. In the case of spheres, we introduce a way of using the first association scheme graph to analyze energy sets, and as a consequence, we obtain new Lp→L4 extension theorems for spheres of primitive radii in odd dimensions, which break the Stein-Tomas result toward Lp→L4 which has stood for more than ten years. Most significantly, it follows from the results for spheres that there exists a different extension phenomenon between spheres and paraboloids in odd dimensions, namely, the Lp→L4 estimates for spheres with primitive radii are much stronger than those for paraboloids. The second purpose is to show that there is a connection between the restriction conjecture associated to paraboloids and the Erdős-Falconer distance conjecture over finite fields. The last is to prove that the Erdős-Falconer distance conjecture holds in odd dimensional spaces when we study distances between two sets: one set lies on a variety (a paraboloid or a sphere), and the other set is arbitrary in vector spaces over finite fields.

Three constructions of perfect authentication codes from projective geometry over finite fields

Using a finite field approach, a novel algebraic construction of low-density parity-check (LDPC) convolutional codes with fast encoding property is proposed. According to the matrices of quasi-cyclic (QC) codes constructed based on the multiplicative groups of finite fields and the algebraic property that a binary circulant matrix is isomorphic to a finite ring, we first generate a polynomial-form parity-check matrix of an LDPC convolutional code under a given rate over a given finite field. Then some related modifications are made upon the original polynomial-form matrix to obtain the new one with fast encoding property. Simulation results show that the proposed LDPC convolutional codes have good performance with the iterative belief propagation decoding algorithm.

Anzahl formulas of subspaces in symplectic spaces and their applications

We study the analogues of the problems of averages and maximal averages over a surface in $\mathbb{R}^{n}$ when the euclidean structure is replaced by that of a vector space over a finite field, and obtain optimal results in a number of model cases.

In this chapter we review the main ideas of linear algebra. The one twist is that we allow our scalars to come from any field instead of just the field of real numbers. In particular, the notion of a vector space over the field \(\mathbb{Z}_{2}\) will be essential in our study of coding theory. We will also need to look at other finite fields when we discuss Reed–Solomon codes. One benefit to working with finite dimensional vector spaces over finite fields is that all sets in question are finite, and so computers can be useful in working with them.

Grassmann codes are linear codes associated with the Grassmann variety $G(\ell,m)$ of $\ell$-dimensional subspaces of an $m$ dimensional vector space $\mathbb{F}_{q}^{m}.$ They were studied by Nogin for general $q.$ These codes are conveniently described using the correspondence between non-degenerate $[n,k]_{q}$ linear codes on one hand and non-degenerate $[n,k]$ projective systems on the other hand. A non-degenerate $[n,k]$ projective system is simply a collection of $n$ points in projective space $\mathbb{P}^{k-1}$ satisfying the condition that no hyperplane of $\mathbb{P}^{k-1}$ contains all the $n$ points under consideration. In this paper we will determine the weight of linear codes $C(3,8)$ associated with Grassmann varieties $G(3,8)$ over an arbitrary finite field $\mathbb{F}_{q}$. We use a formula for the weight of a codeword of $C(3,8)$, in terms of the cardinalities certain varieties associated with alternating trilinear forms on $\mathbb{F}_{q}^{8}.$ For $m=6$ and $7,$ the weight spectrum of $C(3,m)$ associated with $G(3,m),$ have been fully determined by Kaipa K.V, Pillai H.K and Nogin Y. A classification of trivectors depends essentially on the dimension $n$ of the base space. For $n\leq 8 $ there exist only finitely many trivector classes under the action of the general linear group $GL(n).$ The methods of Galois cohomology can be used to determine the classes of nondegenerate trivectors which split into multiple classes when going from $\mathbb{\bar{F}}$ to $\mathbb{F}.$ This program is partially determined by Noui L. and Midoune N. and the classification of trilinear alternating forms on a vector space of dimension $8$ over a finite field $\mathbb{F}_{q}$ of characteristic other than $2$ and $3$ was solved by Noui L. and Midoune N. We describe the $\mathbb{F}_{q}$-forms of $2$-step splitting trivectors of rank $8$, where char $\mathbb{F}_{q}\neq 3.$ This fact we use to determine the weight of the $\mathbb{F}_{q}$-forms.

Let \({L = \mathbb{F}_{q^n}}\) be a finite field and let \({F=\mathbb{F}_q}\) be a subfield of L. Consider L as a vector space over F and the associated projective space that is isomorphic to PG(n − 1, q). The properties of the projective mapping induced by \({x \mapsto x^{-1}}\) have been studied in Csajbok (Finite Fields Appl. 19:55–66, 2013), Faina et al. (Eur. J. Comb. 23:31–35, 2002), Havlicek (Abh. Math. Sem. Univ. Hamburg 53:266–275, 1983), Herzer (Abh. Math. Sem. Univ. Hamburg 55:211–228 1985, Handbook of Incidence Geometry. Buildings and Foundations. Elsevier, Amsterdam, 1995). The image of any line is a normal rational curve in some subspace. In this note a more detailed geometric description is achieved. Consequences are found related to mixed partitions of the projective spaces; in particular, it is proved that for any positive integer k, if q ≥ 2k − 1, then there are partitions of PG(2k − 1, q) in normal rational curves of degree 2k − 1. For smaller q the same construction gives partitions in (q + 1)-tuples of independent points.

Tiling sets and spectral sets over finite fields

Regular and p-regular orbits of solvable linear groups

It has been shown that there is a duality between the linear network coding solution and the entropic vectors induced by collection of subspaces in a vector space over a finite field (dubbed linearly constructed entropic vectors). The region of all linearly constructed vectors, coincides with the set of all representable polymatroids. For any integer polymatroid, there is an associated matroid, which uniquely identifies the polymatroid. We conjecture that the representability of the underlying matroid is a sufficient condition for integer polymatroids to be linearly representable. We prove that the conjecture holds for representation over real numbers. Furthermore, we show that any real-valued submodular function (such as Shannon entropy) can be approximated (arbitrarily close) by an integer polymatroid.