样式: 排序: IF: - GO 导出 标记为已读
-
Additive one-rank hull codes over finite fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-12 Astha Agrawal, R.K. Sharma
This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal elements and solutions of quadratic forms. It also provides a precise count of self-orthogonal elements for any duality over the finite field , particularly odd
-
Symplectic self-orthogonal and linear complementary dual codes from the Plotkin sum construction Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-12 Shixin Zhu, Yang Li, Shitao Li
In this work, we propose two criteria for linear codes obtained from the Plotkin sum construction being symplectic self-orthogonal (SO) and linear complementary dual (LCD). As specific constructions, several classes of symplectic SO codes with good parameters including symplectic maximum distance separable codes are derived via -intersection pairs of linear codes and generalized Reed-Muller codes.
-
Well-covered unitary Cayley graphs of matrix rings over finite fields and applications Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-09 Shahin Rahimi, Ashkan Nikseresht
Suppose that is a finite field and is the ring of -square matrices over . Here we characterize when the Cayley graph of the additive group of with respect to the set of invertible elements of , called the unitary Cayley graph of , is well-covered. Then we apply this to characterize all finite rings with identity whose unitary Cayley graph is well-covered or Cohen-Macaulay.
-
A correction and further improvements to the Chevalley-Warning theorems Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-08 David B. Leep, Rachel L. Petrik
This paper corrects an error in the proof of Theorem 1.4 (3) of our earlier paper, . The error originally appeared in Heath-Brown's paper, , which invalidates the proof of Theorem 2 (iii) in that paper. In this paper, we use a new method to give a correct proof of Theorem 1.4 (3). The correction in this paper also fixes the proof of Theorem 2 (iii) in Heath-Brown's paper. The proof in this paper provides
-
Points of bounded height on projective spaces over global function fields via geometry of numbers Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-08 Tristan Phillips
We give a new proof of a result of DiPippo and Wan for counting points of bounded height on projective spaces over global function fields. The new proof adapts the geometry of numbers arguments used by Schanuel in the number field case.
-
Arithmetic crosscorrelation of binary m-sequences with coprime periods Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-06 Xiaoyan Jing, Keqin Feng
The arithmetic crosscorrelation of binary -sequences with coprime periods and () is determined. The result shows that the absolute value of arithmetic crosscorrelation of such binary -sequences is not greater than .
-
Bivariate functions with low c-differential uniformity Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-06 Yanan Wu, Pantelimon Stănică, Chunlei Li, Nian Li, Xiangyong Zeng
Starting with the multiplication of elements in which is consistent with that over , where is a prime power, via some identification of the two environments, we investigate the -differential uniformity for bivariate functions . By carefully choosing the functions and , we present several constructions of bivariate functions with low -differential uniformity, in particular, many PN and APN functions
-
Hamming distances of constacyclic codes of length 7ps over [formula omitted] Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-04-05 Hai Q. Dinh, Hieu V. Ha, Nhan T.V. Nguyen, Nghia T.H. Tran, Thieu N. Vo
In this paper, we study constacyclic codes of length over a finite field of characteristics , where is an odd prime number and a positive integer. The previous methods in the literature that were used to compute the Hamming distances of repeated-root constacyclic codes of lengths with cannot be applied to completely determine the Hamming distances of those with . This is due to the high computational
-
On trivial cyclically covering subspaces of [formula omitted] Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-29 Jing Huang
A subspace of is called a cyclically covering subspace if for every vector of , operating a certain number of cyclic shifts on it, the resulting vector lies in the subspace. In this paper, we study the problem of under what conditions is itself the only covering subspace of , symbolically, , which is an open problem posed in Cameron et al. (2019) and Aaronson et al. (2021) . We apply the primitive
-
Application of the Cartier operator in coding theory Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-29 Vahid Nourozi
The -number is an invariant of the isomorphism class of the -torsion group scheme. We use the Cartier operator on to find a closed formula for the -number of the form where over the finite field . The application of the computed -number in coding theory is illustrated by the relationship between the algebraic properties of the curve and the parameters of codes that are supported by it.
-
Constructing permutation polynomials from permutation polynomials of subfields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-29 Lucas Reis, Qiang Wang
In this paper we study the permutational property of polynomials of the form over the finite field , where are -linearized polynomials and satisfies a generic condition. We specialize in the case where is the linearized -associate of , is a divisor of and satisfies . This unifies many recent explicit constructions and provides new explicit constructions of permutation polynomials and their inverses
-
Private information retrieval from locally repairable databases with colluding servers Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-28 Umberto Martínez-Peñas
We consider information-theoretical private information retrieval (PIR) from a coded database with colluding servers. We target, for the first time, locally repairable storage codes (LRCs). We consider any number of local groups , locality , local distance and dimension . Our main contribution is a PIR scheme for maximally recoverable (MR) LRCs based on linearized Reed–Solomon codes, which achieve
-
On permutation quadrinomials from Niho exponents in characteristic two Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-26 Vincenzo Pallozzi Lavorante
Recently Zheng et al. characterized the coefficients of over that lead to be a permutation of for . They left open the question whether those conditions were also necessary. In this paper, we give a positive answer to that question, solving their conjecture.
-
Primitive elements of finite fields [formula omitted] avoiding affine hyperplanes for q = 4 and q = 5 Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-26 Philipp A. Grzywaczyk, Arne Winterhof
For a finite field with fixed and sufficiently large, we prove the existence of a primitive element outside of a set of many affine hyperplanes for and . This complements earlier results by Fernandes and Reis for . For the analogous result can be derived from a very recent bound on character sums of Iyer and Shparlinski. For the set consists only of a single element, and such a result is thus not possible
-
New classes of permutation trinomials of [formula omitted] Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-26 Akshay Ankush Yadav, Indivar Gupta, Harshdeep Singh, Arvind Yadav
In recent years, there have been a lot of research towards finding conditions under which the trinomial permutes with and being positive integers. The authors of have determined these conditions when for certain values of and . In this paper, we work for and determine four new classes of such permutation trinomials. Our contribution encompasses the investigation of these unexplored classes. Additionally
-
Irreducibility properties of Carlitz' binomial coefficients for algebraic function fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-26 Robert Tichy, Daniel Windisch
We study the class of univariate polynomials , introduced by Carlitz, with coefficients in the algebraic function field over the finite field with elements. It is implicit in the work of Carlitz that these polynomials form an -module basis of the ring of integer-valued polynomials on the polynomial ring . This stands in close analogy to the famous fact that a -module basis of the ring is given by the
-
Plane curves with a large linear automorphism group in characteristic p Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-22 Herivelto Borges, Gábor Korchmáros, Pietro Speziali
Let be a subgroup of the three dimensional projective group defined over a finite field of order , viewed as a subgroup of where is an algebraic closure of . For and for the seven nonsporadic, maximal subgroups of , we investigate the (projective, irreducible) plane curves defined over that are left invariant by . For each, we compute the minimum degree of -invariant curves, provide a classification
-
On a class of permutation polynomials and their inverses Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-18 Ruikai Chen, Sihem Mesnager
We introduce a class of permutation polynomial over that can be written in the form or for some -linear polynomial over . Specifically, we present those permutation polynomials explicitly as well as their inverses. In addition, more permutation polynomials can be derived in a more general form.
-
On dual-containing, almost dual-containing matrix-product codes and related quantum codes Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-13 Meng Cao
Matrix-product (MP) codes are a type of long codes formed by combining several commensurate constituent codes with a defining matrix. In this paper, we study the MP code when the defining matrix satisfies the condition that is -monomial. We give an explicit formula for calculating the dimension of the hull of a MP code. We present the necessary and sufficient conditions for a MP code to be dual-containing
-
The extended codes of some linear codes Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-12 Zhonghua Sun, Cunsheng Ding, Tingfang Chen
The classical way of extending an linear code is to add an overall parity-check coordinate to each codeword of the linear code . This extended code, denoted by and called the standardly extended code of , is a linear code with parameters , where or . This is one of the two extending techniques for linear codes in the literature. The standardly extended codes of some families of binary linear codes
-
Non-Abelian extensions of degree p3 and p4 in characteristic p > 2 Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-12 Grant Moles
This paper describes in terms of Artin-Schreier equations field extensions whose Galois group is isomorphic to any of the four non-cyclic groups of order or the ten non-Abelian groups of order , an odd prime, over a field of characteristic .
-
Diagonal hypersurfaces and elliptic curves over finite fields and hypergeometric functions Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-05 Sulakashna, Rupam Barman
Let denote the family of diagonal hypersurface over a finite field given by where , , and . Let denote the number of points on in . It is easy to see that is equal to the number of distinct zeros of the polynomial in . In this article, we prove that is also equal to the number of distinct zeros of the polynomial in . We express the number of distinct zeros of the polynomial in terms of a -adic hypergeometric
-
A structure theorem for the restricted sum of four squares Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-01 Wei Wang, Weijia Wang, Hao Zhang
Let be an odd prime. We show that each solution of the system of congruence equations and corresponds to precisely four solutions of the system of Diophantine equations and that are pairwise orthogonal over , partially answering a conjecture proposed in Wang et al. . The result was obtained by counting the number of solutions of both equations using Gaussian sum and modular forms, and the classical
-
A class of double-twisted generalized Reed-Solomon codes Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-03-01 Canze Zhu, Qunying Liao
In this paper, let be a prime power, we focus on a class of double-twisted generalized Reed-Solomon code over . We give a sufficient and necessary condition for to be MDS or AMDS, and prove that is non-GRS by calculating the Schur square of its dual code. Furthermore, we present a sufficient and necessary condition for to be self-dual, and then construct several classes of self-dual NMDS or non-GRS
-
Transverse linear subspaces to hypersurfaces over finite fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-28 Shamil Asgarli, Lian Duan, Kuan-Wen Lai
Ballico proved that a smooth projective variety of degree and dimension over a finite field of elements admits a smooth hyperplane section if . In this paper, we refine this criterion for higher codimensional linear sections on smooth hypersurfaces and for hyperplane sections on Frobenius classical hypersurfaces. We also prove a similar result for the existence of reduced hyperplane sections on reduced
-
Some new classes of additive MDS and almost MDS codes over finite fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-27 Monika Yadav, Anuradha Sharma
In this paper, we introduce and study two new classes of additive codes over finite fields, additive generalized Reed-Solomon (additive GRS) codes and additive generalized twisted Reed-Solomon (additive GTRS) codes, which are extensions of linear generalized Reed-Solomon (GRS) codes and twisted Reed-Solomon (GTRS) codes, respectively. Unlike linear GRS codes, additive GRS codes are not maximum distance
-
Constructions and decoding of GC-balanced codes for edit errors Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-27 Kenan Wu, Shu Liu
DNA-based storage has been a promising technique of data storage, due to its high density and long duration. During synthesizing and sequencing of DNA storage, edit errors including insertions, deletions and substitutions are introduced inevitably. An effective way to reduce the error probability is to limit the content of G and C in DNA sequences to around 50%, which is called GC-balanced. To deal
-
On m-ovoids of Q+(7,q) with q odd Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-22 Sam Adriaensen, Jan De Beule, Giovanni Giuseppe Grimaldi, Jonathan Mannaert
In this paper, we provide a construction of -ovoids of the hyperbolic quadric , an odd prime power, by glueing -ovoids of the elliptic quadric . This is possible by controlling some intersection properties of (putative) -ovoids of elliptic quadrics. It eventually yields -ovoids of not coming from a 1-system. Secondly, for certain values of , we construct line spreads of that have as many secants to
-
On subgroup perfect codes in Cayley sum graphs Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-22 J, u, n, y, a, n, g, , Z, h, a, n, g
A perfect code in a graph Γ is an independent set of vertices of Γ such that every vertex outside is adjacent to a unique vertex in , and a total perfect code in Γ is a set of vertices of Γ such that every vertex of Γ is adjacent to a unique vertex in . Let be a finite group and a normal subset of . The Cayley sum graph of with the connection set is the graph with vertex set and two vertices and being
-
AG codes on flag bundles over a curve Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-22 T, o, h, r, u, , N, a, k, a, s, h, i, m, a
In the present paper, we construct codes from the flag bundle associated to a vector bundle over a curve. Our code may be considered as a relative version of the codes on the flag variety studied by F. Rodier. We investigate the dimension and the minimum distance of such relative Rodier codes using intersection theory. For this purpose, we exploit the invariants of vector bundles which control the
-
Saturating linear sets of minimal rank Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-21 Daniele Bartoli, Martino Borello, Giuseppe Marino
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this paper, we consider the recently introduced linear version of such sets, which is, in turn, related to the covering problem in the rank metric. The main questions
-
Construction of εd-ASIC-POVMs via 2-to-1 PN functions and the Li bound Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-20 Meng Cao, Xiantao Deng
Symmetric informationally complete positive operator-valued measures (SIC-POVMs) in finite dimension are a particularly attractive case of informationally complete POVMs (IC-POVMs), which consist of subnormalized projectors with equal pairwise fidelity. However, it is difficult to construct SIC-POVMs, and it is not even clear whether there exists an infinite family of SIC-POVMs. To realize some possible
-
Weight distribution of double cyclic codes over [formula omitted] Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-20 Xiangrui Meng, Jian Gao, Fang-Wei Fu
In this paper, we determine the Hamming weight distribution of several classes of double cyclic codes over the finite non-chain ring with , which is isomorphic to . Some two-weight and three-weight linear codes over the finite field are constructed by double cyclic codes over this ring.
-
Twisted group algebras of Abelian groups Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-15 André Duarte, Raul Antonio Ferraz, César Polcino Milies
We study twistings for finite Abelian groups over fields and then show how to extend the notion of idempotent determined by a subgroup, so useful in the case of group algebras, to the case of twisted group algebras, at least when the subgroup is cyclic. In doing so, we obtain a method to compute in a direct way the primitive central idempotents of these algebras over a finite field and fully describe
-
Enveloping sieve related to the Hardy-Littlewood irreducible tuple conjecture in a function field Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-09 G, u, o, q, u, a, n, , L, i
Let be the polynomial ring over the finite field of elements. For , let with . Let denote the product of linear functions . Let be the set of all monic polynomials in such that is the product of monic irreducible polynomials in . The Hardy-Littlewood -tuple conjecture provides an asymptotic formula for the cardinality of the set when tends to ∞. In this paper an -version of the enveloping sieve theory
-
Codes over a ring of order 32 with two Gray maps Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-09 S.T. Dougherty, J. Gildea, A. Korban, A.M. Roberts
We describe a ring of order 32 and prove that it is a local Frobenius ring. We study codes over this ring and we give two distinct non-equivalent linear orthogonality-preserving Gray maps to the binary space. Self-dual codes are studied over this ring as well as the binary self-dual codes that are the Gray images of those codes. Specifically, we show that the image of a self-dual code over this ring
-
Characterizations of a class of planar functions over finite fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-08 Ruikai Chen, Sihem Mesnager
Planar functions, introduced by Dembowski and Ostrom, have attracted much attention in the last decade. As shown in this paper, we present a new class of planar functions of the form on an extension of the finite field . Specifically, we investigate those functions on and construct several typical kinds of planar functions. We also completely characterize them on . When the degree of extension is higher
-
New constructions of optimal binary LCD codes Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-08 Guodong Wang, Shengwei Liu, Hongwei Liu
Linear complementary dual (LCD) codes provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used against side-channel attacks and fault non-invasive attacks. In this paper, we obtain a lower bound on the distance of binary LCD codes through expanded codes. We give necessary and sufficient conditions to extend binary LCD codes to binary and LCD codes
-
Exceptionality of (X+1)n + (X−1)n Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-05 Zhiguo Ding, Michael E. Zieve
We determine all prime powers and all positive integers for which and permutes . We also exhibit instances of these polynomials which are closely related to Dickson polynomials, and we give a similar connection between Dickson polynomials and the polynomials .
-
Zero testing and equation solving for sparse polynomials on rectangular domains Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-02 Erhard Aichinger, Simon Grünbacher, Paul Hametner
We consider sparse polynomials in variables over a finite field, and ask whether they vanish on a set , where is a set of nonzero elements of the field. We see that if for a polynomial , there is ▪ with ▪, then there is such a ▪ in every ball (with respect to the Hamming distance) inside , where the radius of the ball is bounded by a multiple of the logarithm of the number of monomials that appear
-
Hausdorff dimension for sets of continued fractions of formal Laurent series Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-01 Mumtaz Hussain, Nikita Shulga
We prove the Hausdorff dimension of various limsup sets over the field of formal power series. Typically, the upper bound is easier to establish by considering the natural covering of the underlying set. To establish the lower bound, we identify a suitable set that serves as a subset of several limsup sets by selecting appropriate values for the involved parameters. To be precise, given a fixed integer
-
On LCD codes from skew symmetric Toeplitz matrices Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-01 K, a, i, m, i, n, , C, h, e, n, g
A linear code with complementary dual (or an LCD code) is defined to be a linear code which intersects its dual code trivially. Let be an identity matrix and be a Toeplitz matrix of the same order over a finite field. A Double Toeplitz code (or a DT code) is a linear code generated by a generator matrix of the form . In 2021, Shi et al. obtained necessary and sufficient conditions for a Double Toeplitz
-
Several classes of permutation polynomials based on the AGW criterion over the finite field [formula omitted] Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-01 Guanghui Li, Xiwang Cao
Let denote the finite field with elements. Permutation polynomials and complete permutation polynomials over finite fields have been widely investigated in recent years due to their applications in cryptography, coding theory and combinatorial design. In this paper, several classes of (complete) permutation polynomials with the form and are proposed based on the AGW criterion and some techniques in
-
Superzeta functions on function fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-02-01 Kajtaz H. Bllaca, Jawher Khmiri, Kamel Mazhouda, Bouchaïb Sodaïgui
We study the superzeta functions on function fields as constructed by Voros (see ) in the case of the classical Riemann zeta function. Furthermore, we study special values of those functions, relate them to the Li coefficients, deduce some interesting summation formulas, and prove some results about the regularized product of the zeros of zeta functions on function fields.
-
A new direction on constructing irreducible polynomials over finite fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-25 K, a, i, m, i, n, , C, h, e, n, g
Let be a power of a prime and be the finite field of order . Let be any polynomial in and . For any positive integer , denote to be the -th iterate of Φ and to be the denominator of . We call inversely stable over if are distinct and irreducible over for all . In this paper, we aim to find a class of inversely stable polynomials over . Actually, let , it is proved that is inversely stable over if and
-
A note on t-designs in isodual codes Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-24 Madoka Awada, Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora
In the present paper, we construct 3-designs using extended binary quadratic residue codes and their dual codes.
-
New constructions of optimal (r,δ)-LRCs via good polynomials Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-24 Yuan Gao, Siman Yang
Locally repairable codes (LRCs) are a class of erasure codes that are widely used in distributed storage systems, which allow for efficient recovery of data in the case of node failures or data loss. In 2014, Tamo and Barg introduced Reed-Solomon-like (RS-like) Singleton-optimal -LRCs based on polynomial evaluation. These constructions rely on the existence of so-called good polynomial that is constant
-
Constructing permutation polynomials over [formula omitted] from bijections of PG(2,q) Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-23 Longjiang Qu, Kangquan Li
Over the past several years, there are numerous papers about permutation polynomials of the form over . A bijection between the multiplicative subgroup of and the projective line plays a very important role in the research. In this paper, we mainly construct permutation polynomials of the form over from bijections of the projective plane . A bijection from the multiplicative subgroup of to is studied
-
Permutation rational functions over quadratic extensions of finite fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-23 Ruikai Chen, Sihem Mesnager
Permutation rational functions over finite fields have attracted much attention in recent years. In this paper, we introduce a class of permutation rational functions over , whose numerators are so-called -quadratic polynomials. To this end, we will first determine the exact number of zeros of a special -quadratic polynomial in , by calculating character sums related to quadratic forms of . Then given
-
-
Matrices in [formula omitted] with quadratic minimal polynomial Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-16 J, a, c, o, b, u, s, , V, i, s, s, e, r, , v, a, n, , Z, y, l
By a result of Latimer and MacDuffee, there are a finite number of equivalence classes of matrices over with minimum polynomial , where is an degree polynomial, irreducible over . In this paper, we develop an algorithm for finding a canonical representative of each matrix class, for .
-
F-valued trace of a finite-dimensional commutative F-algebra Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-15 A.K. Bhagat, R. Sarma
A non-zero F-valued F-linear map on a finite-dimensional commutative F-algebra is called an F-valued trace if its kernel contains no non-zero ideals. However, given an F-algebra, such a map may not always exist. We find an infinite class of finite-dimensional commutative F-algebras which admit an F-valued trace. In fact, in these cases, we explicitly construct a trace map. An F-valued trace on a finite-dimensional
-
Locally recoverable codes from towers of function fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-08 M. Chara, F. Galluccio, E. Martínez-Moro
In this work we construct sequences of locally recoverable AG codes arising from a tower of function fields and give bound for the parameters of the obtained codes. In a particular case of a tower over Fq2 for any odd q, defined by Garcia and Stichtenoth in [3], we show that the bound is sharp for the first code in the sequence, and we include a detailed analysis for the following codes in the sequence
-
Bilinear forms with Kloosterman and Gauss sums in function fields Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-08 Christian Bagshaw
In recent years, there has been a lot of progress in obtaining non-trivial bounds for bilinear forms of Kloosterman sums in Z/mZ for arbitrary integers m. These results have been motivated by a wide variety of applications, such as improved asymptotic formulas for moments of L-functions. However, there has been very little work done in this area in the setting of rational function fields over finite
-
On the eigenvalues of the graphs D(5,q) Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-03 Himanshu Gupta, Vladislav Taranchuk
Let q=pe, where p is a prime and e is a positive integer. The family of graphs D(k,q), defined for any positive integer k and prime power q, were introduced by Lazebnik and Ustimenko in 1995. To this day, the connected components of the graphs D(k,q), provide the best known general lower bound for the size of a graph of given order and given girth. Furthermore, Ustimenko conjectured that the second
-
Hermitian self-dual 2-quasi-abelian codes Finite Fields Their Appl. (IF 1.0) Pub Date : 2024-01-04 Guanghui Zhang, Liren Lin, Chunyan Qin, Ruibo Li
In this paper, we construct a class of Hermitian self-dual 2-quasi-abelian codes over a finite field. Based on counting the number of such codes and estimating the number of the codes in this class whose relative minimum weights are small, we prove that the class of Hermitian self-dual 2-quasi-abelian codes over any finite field is asymptotically good. The existence of such codes is unconditional,
-
Subfield subcodes of projective Reed-Muller codes Finite Fields Their Appl. (IF 1.0) Pub Date : 2023-12-27 Philippe Gimenez, Diego Ruano, Rodrigo San-José
Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective space, we generalize the necessary tools to deal with this case as well: we obtain a universal Gröbner basis for the vanishing ideal of the set of standard representatives
-
Two classes of permutation trinomials over Fq3 in characteristic two Finite Fields Their Appl. (IF 1.0) Pub Date : 2023-12-20 Lijing Zheng, Haibin Kan, Tongliang Zhang, Jie Peng, Yanjun Li
Let q=2m and Fq3 be the finite field with q3 elements. In this paper, based on the multivariate method, resultant elimination, and transforming into dealing with some equations over finite fields, we propose two classes of permutation trinomials of Fq3. We illustrate that these two classes of permutation trinomials are QM-inequivalent to all known permutation polynomials over Fq3. Some well-known results
-
Fourth power mean of the general s-dimensional Kloosterman sum mod p Finite Fields Their Appl. (IF 1.0) Pub Date : 2023-12-15 Nilanjan Bag, Anup Haldar
In this article, we prove an asymptotic formula for the fourth power mean of a general s-dimensional hyper-Kloosterman sum. We find the number of solutions of certain congruence equations mod p which play an integral part to prove our main result. We use estimates for character sums and analytic methods to prove our theorem.
-
Codes and pseudo-geometric designs from the ternary m-sequences with Welch-type decimation d = 2 ⋅ 3(n−1)/2 + 1 Finite Fields Their Appl. (IF 1.0) Pub Date : 2023-12-06 Can Xiang, Chunming Tang, Haode Yan, Min Guo
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the methods of finite geometries and combinatorics. However, none of pseudo-geometric designs with the parameters S(2,q+1,(qn−1)/(q−1)) is constructed by the approach of coding