首页 > 最新文献

Finite Fields and Their Applications最新文献

英文 中文
Some new classes of permutation pentanomials and hexanomials over Fq3 with even characteristic Fq3上一些具有偶特征的新置换五异象和六异象
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-06-01 Epub Date: 2026-02-09 DOI: 10.1016/j.ffa.2026.102811
Ruihua Shen , Xianping Liu , Xiaofang Xu
Sparse permutation polynomials over finite fields have attracted more and more researchers' attention due to their simple algebraic structure and wide applications in many areas. In this paper, we propose three classes of permutation pentanomials over the finite field Fq3 with even characteristic and provide the explicit expression of the compositional inverse for one of them. Furthermore, two classes of permutation hexanomials over Fq3 are constructed, and their explicit expressions of the compositional inverses are determined. The results are derived by investigating the solutions of some equations, employing the resultant elimination and multivariate methods.
有限域上的稀疏置换多项式以其简单的代数结构和在许多领域的广泛应用而受到越来越多研究者的关注。本文给出了有限域Fq3上具有偶特征的3类置换五反常,并给出了其中一类的组合逆的显式表达式。进一步构造了Fq3上的两类置换六反常,并确定了它们的组合逆的显式表达式。结果是通过研究一些方程的解,采用结果消元法和多元方法得到的。
{"title":"Some new classes of permutation pentanomials and hexanomials over Fq3 with even characteristic","authors":"Ruihua Shen ,&nbsp;Xianping Liu ,&nbsp;Xiaofang Xu","doi":"10.1016/j.ffa.2026.102811","DOIUrl":"10.1016/j.ffa.2026.102811","url":null,"abstract":"<div><div>Sparse permutation polynomials over finite fields have attracted more and more researchers' attention due to their simple algebraic structure and wide applications in many areas. In this paper, we propose three classes of permutation pentanomials over the finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msub></math></span> with even characteristic and provide the explicit expression of the compositional inverse for one of them. Furthermore, two classes of permutation hexanomials over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msub></math></span> are constructed, and their explicit expressions of the compositional inverses are determined. The results are derived by investigating the solutions of some equations, employing the resultant elimination and multivariate methods.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"112 ","pages":"Article 102811"},"PeriodicalIF":1.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The unit f-sequence for primitive-based f 基于基元的f的单位f序列
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-06-01 Epub Date: 2026-01-19 DOI: 10.1016/j.ffa.2026.102793
Owen J. Brison , J. Eurico Nogueira
We study the behaviour with respect to the operation of lifting of the unit g-sequence, where g(t) is a primitive polynomial. We also study the unit f-sequence for primitive-based f(t) and show it is closely related to the lifted unit g-sequence where f(t) is based on g(t).
研究了单位g序列关于提升运算的性质,其中g(t)是一个原始多项式。我们还研究了基于基元的f(t)的单位f序列,并证明它与提升的单位g序列密切相关,其中f(t)基于g(t)。
{"title":"The unit f-sequence for primitive-based f","authors":"Owen J. Brison ,&nbsp;J. Eurico Nogueira","doi":"10.1016/j.ffa.2026.102793","DOIUrl":"10.1016/j.ffa.2026.102793","url":null,"abstract":"<div><div>We study the behaviour with respect to the operation of lifting of the unit <em>g</em>-sequence, where <span><math><mi>g</mi><mo>(</mo><mi>t</mi><mo>)</mo></math></span> is a primitive polynomial. We also study the unit <em>f</em>-sequence for primitive-based <span><math><mi>f</mi><mo>(</mo><mi>t</mi><mo>)</mo></math></span> and show it is closely related to the lifted unit <em>g</em>-sequence where <span><math><mi>f</mi><mo>(</mo><mi>t</mi><mo>)</mo></math></span> is based on <span><math><mi>g</mi><mo>(</mo><mi>t</mi><mo>)</mo></math></span>.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"112 ","pages":"Article 102793"},"PeriodicalIF":1.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Construction of several infinite families of linear codes with new parameters: Hamming weight enumerators and hull dimensions 具有新参数:汉明权重枚举数和船体尺寸的若干无限族线性码的构造
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-06-01 Epub Date: 2026-01-13 DOI: 10.1016/j.ffa.2025.102789
Lavanya G, Anuradha Sharma
<div><div>Let <em>q</em> be a prime power, and let <em>m</em>, <em>v</em>, <em>t</em> be integers satisfying <span><math><mn>2</mn><mo>≤</mo><mi>t</mi><mo><</mo><mi>v</mi><mo>≤</mo><mi>m</mi></math></span> and <span><math><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi><mo>−</mo><mi>t</mi></mrow></msup><mo>></mo><mrow><mo>(</mo><mtable><mtr><mtd><mi>v</mi></mtd></mtr><mtr><mtd><mi>t</mi></mtd></mtr></mtable><mo>)</mo></mrow><mo>≥</mo><mn>3</mn></math></span>, where <span><math><mo>(</mo><mtable><mtr><mtd><mo>⋅</mo></mtd></mtr><mtr><mtd><mo>⋅</mo></mtd></mtr></mtable><mo>)</mo></math></span> denotes the binomial coefficient. Let <em>X</em> be a subset of <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>m</mi><mo>}</mo></math></span> with <span><math><mo>|</mo><mi>X</mi><mo>|</mo><mo>=</mo><mi>v</mi></math></span>. In this paper, we consider the set <span><math><mi>Δ</mi><mo>=</mo><mo>{</mo><mi>u</mi><mo>∈</mo><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msubsup><mo>:</mo><mtext>supp</mtext><mo>(</mo><mi>u</mi><mo>)</mo><mo>⊆</mo><mi>X</mi><mtext> and </mtext><mi>w</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>≤</mo><mi>t</mi><mo>}</mo></math></span>, where <span><math><mtext>supp</mtext><mo>(</mo><mo>⋅</mo><mo>)</mo></math></span> denotes the support of a vector and <span><math><mi>w</mi><mo>(</mo><mo>⋅</mo><mo>)</mo></math></span> denotes the Hamming weight function. We first observe that the set Δ is a simplicial complex of <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msubsup></math></span> with support <span><math><mi>A</mi><mo>=</mo><mo>{</mo><msub><mrow><mi>A</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>b</mi></mrow></msub><mo>}</mo></math></span> consisting of all distinct subsets of <em>X</em> with cardinality <em>t</em>. Note that <span><math><mi>b</mi><mo>=</mo><mrow><mo>(</mo><mtable><mtr><mtd><mi>v</mi></mtd></mtr><mtr><mtd><mi>t</mi></mtd></mtr></mtable><mo>)</mo></mrow><mo>≥</mo><mn>3</mn></math></span>, <span><math><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∖</mo><mo>(</mo><munder><mo>⋃</mo><mrow><mn>1</mn><mo>≤</mo><mi>j</mi><mo>(</mo><mo>≠</mo><mi>i</mi><mo>)</mo><mo>≤</mo><mi>b</mi></mrow></munder><msub><mrow><mi>A</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo><mo>=</mo><mo>∅</mo></math></span> for <span><math><mn>1</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mi>b</mi></math></span>, and the pair <span><math><mo>(</mo><mi>X</mi><mo>,</mo><mi>A</mi><mo>)</mo></math></span> forms a trivial Steiner system. In this paper, we study linear codes over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> with defining sets <span><math><msup><mrow><mi>Δ</mi></mrow><mrow><mi>c</mi></mrow></msup><mo>=</mo><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</
设q为质数幂,设m、v、t为满足2≤t<;v≤m且qm−t>;(vt)≥3的整数,其中(⋅⋅)为二项式系数。设X是{1,2,…,m}的子集,其中|X|=v。本文考虑集合Δ={u∈Fqm:supp(u)≤X, w(u)≤t},其中supp(⋅)表示向量的支持度,w(⋅)表示Hamming权函数。我们首先观察到集合Δ是支持a ={A1,A2,…,Ab}的Fqm的简单复形,由基数为t的X的所有不同子集组成。注意b=(vt)≥3,Ai∈(∈1≤j(≠i)≤bAj)=∅,对于1≤i≤b,并且对(X, a)形成一个平凡的Steiner系统。在本文中,我们研究了具有定义集Δc=Fqm∈Δ和Δ =Δ∈{0}的Fq上的线性码。我们还研究了Fq上的射影码,定义了集合和,其中和分别是Δc和Δ的极大子集,它们的向量生成Fqm在Fq上的不同的一维子空间。我们显式地确定了这些码的参数和Hamming权枚举数,并推导了具有定义集Δc和最小的码的充分条件。作为应用,我们得到了几个无限族的少权投影码、距离最优码、几乎距离最优码、Griesmer码、近Griesmer码和极小码。我们还确定了它们的双码参数。当m=v时,我们证明了具有定义集的Fq上的射影码是最优可扩展的,从而提供了一种构造Fq上无限类最优可扩展码的方法。此外,我们研究了Fq上具有定义集Δc和Δ 的线性码的壳,并证明了这些码对于q>;3是自正交的。对于q∈{2,3},我们显式地确定了这些代码的壳体尺寸。我们也得到了无限类的二、三元自正交码、LCD码和一维壳的线性码。
{"title":"Construction of several infinite families of linear codes with new parameters: Hamming weight enumerators and hull dimensions","authors":"Lavanya G,&nbsp;Anuradha Sharma","doi":"10.1016/j.ffa.2025.102789","DOIUrl":"10.1016/j.ffa.2025.102789","url":null,"abstract":"&lt;div&gt;&lt;div&gt;Let &lt;em&gt;q&lt;/em&gt; be a prime power, and let &lt;em&gt;m&lt;/em&gt;, &lt;em&gt;v&lt;/em&gt;, &lt;em&gt;t&lt;/em&gt; be integers satisfying &lt;span&gt;&lt;math&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;&gt;&lt;/mo&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;≥&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; denotes the binomial coefficient. Let &lt;em&gt;X&lt;/em&gt; be a subset of &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;…&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; with &lt;span&gt;&lt;math&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;. In this paper, we consider the set &lt;span&gt;&lt;math&gt;&lt;mi&gt;Δ&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mtext&gt;supp&lt;/mtext&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⊆&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mtext&gt; and &lt;/mtext&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;mtext&gt;supp&lt;/mtext&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; denotes the support of a vector and &lt;span&gt;&lt;math&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; denotes the Hamming weight function. We first observe that the set Δ is a simplicial complex of &lt;span&gt;&lt;math&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;/math&gt;&lt;/span&gt; with support &lt;span&gt;&lt;math&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;…&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; consisting of all distinct subsets of &lt;em&gt;X&lt;/em&gt; with cardinality &lt;em&gt;t&lt;/em&gt;. Note that &lt;span&gt;&lt;math&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;≥&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;, &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;∖&lt;/mo&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;munder&gt;&lt;mo&gt;⋃&lt;/mo&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;j&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mo&gt;≠&lt;/mo&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;/mrow&gt;&lt;/munder&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;j&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;∅&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; for &lt;span&gt;&lt;math&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;, and the pair &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; forms a trivial Steiner system. In this paper, we study linear codes over &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; with defining sets &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;Δ&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;c&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"112 ","pages":"Article 102789"},"PeriodicalIF":1.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On generalized Weierstrass semigroups in arbitrary Kummer extensions of Fq(x) 关于Fq(x)的任意Kummer扩展中的广义Weierstrass半群
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-06-01 Epub Date: 2026-02-03 DOI: 10.1016/j.ffa.2026.102808
Alonso S. Castellanos , Erik Mendoza , Guilherme Tizziotti
In this work, we investigate generalized Weierstrass semigroups in arbitrary Kummer extensions of the rational function field Fq(x). We analyze their structure and properties, with a particular emphasis on their maximal elements. Explicit descriptions of the sets of absolute and relative maximal elements within these semigroups are provided. Additionally, we apply our results to function fields of the maximal curves Xa,b,n,s and Yn,s, which cannot be covered by the Hermitian curve, and the Beelen-Montanucci curve. Our results generalize and unify several earlier contributions in the theory of Weierstrass semigroups, providing new perspectives on the relationship between these semigroups and function fields.
本文研究了有理函数域Fq(x)的任意Kummer扩展中的广义Weierstrass半群。我们分析了它们的结构和性质,特别强调了它们的最大元素。给出了这些半群中绝对极大元和相对极大元的集合的显式描述。此外,我们将我们的结果应用于最大曲线Xa,b,n,s和Yn,s的函数场,这些函数场不能被厄米曲线和Beelen-Montanucci曲线覆盖。我们的研究结果推广和统一了weerstrass半群理论的一些早期贡献,为研究这些半群与函数场之间的关系提供了新的视角。
{"title":"On generalized Weierstrass semigroups in arbitrary Kummer extensions of Fq(x)","authors":"Alonso S. Castellanos ,&nbsp;Erik Mendoza ,&nbsp;Guilherme Tizziotti","doi":"10.1016/j.ffa.2026.102808","DOIUrl":"10.1016/j.ffa.2026.102808","url":null,"abstract":"<div><div>In this work, we investigate generalized Weierstrass semigroups in arbitrary Kummer extensions of the rational function field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo></math></span>. We analyze their structure and properties, with a particular emphasis on their maximal elements. Explicit descriptions of the sets of absolute and relative maximal elements within these semigroups are provided. Additionally, we apply our results to function fields of the maximal curves <span><math><msub><mrow><mi>X</mi></mrow><mrow><mi>a</mi><mo>,</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>,</mo><mi>s</mi></mrow></msub></math></span> and <span><math><msub><mrow><mi>Y</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>s</mi></mrow></msub></math></span>, which cannot be covered by the Hermitian curve, and the Beelen-Montanucci curve. Our results generalize and unify several earlier contributions in the theory of Weierstrass semigroups, providing new perspectives on the relationship between these semigroups and function fields.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"112 ","pages":"Article 102808"},"PeriodicalIF":1.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Galois lines for a space model of the quotient of the Hermitian curve by an involution in odd characteristic 用奇特征对合得到厄密曲线商的空间模型的伽罗瓦线
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-06-01 Epub Date: 2026-02-03 DOI: 10.1016/j.ffa.2026.102810
Satoru Fukasawa
This paper describes the arrangement of all Galois lines for a space model of the quotient of the Hermitian curve by an involution in odd characteristic, in terms of the geometry over finite fields. This paper also determines all Galois points for three plane models of this curve admitting three or more Galois points.
本文从有限域几何的角度,用奇特征对合的方法描述了厄密曲线商的空间模型中所有伽罗瓦线的排列。本文还确定了该曲线的三个平面模型的所有伽罗瓦点,这些平面模型包含三个或更多的伽罗瓦点。
{"title":"Galois lines for a space model of the quotient of the Hermitian curve by an involution in odd characteristic","authors":"Satoru Fukasawa","doi":"10.1016/j.ffa.2026.102810","DOIUrl":"10.1016/j.ffa.2026.102810","url":null,"abstract":"<div><div>This paper describes the arrangement of all Galois lines for a space model of the quotient of the Hermitian curve by an involution in odd characteristic, in terms of the geometry over finite fields. This paper also determines all Galois points for three plane models of this curve admitting three or more Galois points.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"112 ","pages":"Article 102810"},"PeriodicalIF":1.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Gowers U3 norm of five classes of power permutations 五类幂置换的Gowers U3范数
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-06-01 Epub Date: 2026-02-06 DOI: 10.1016/j.ffa.2026.102813
Zhaole Li, Deng Tang
<div><div>Vectorial Boolean functions from <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msubsup></math></span> to <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msubsup></math></span> are fundamental objects in theoretical computer science and mathematics. Understanding their structure, particularly how well they can be approximated by low-degree functions, is crucial in various applications, including pseudorandomness, property testing, and cryptography. The Gowers uniformity norm, introduced in additive combinatorics, provides a powerful measure for these purposes, serving as a key indicator of the approximation and has significant applications in mathematics and theoretical computer science. While the Gowers <span><math><msub><mrow><mi>U</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> norm is well-understood, the analysis of higher-order structures, particularly the Gowers <span><math><msub><mrow><mi>U</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span> norm for <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span>, poses significant challenges. Indeed, the computation of the Gowers <span><math><msub><mrow><mi>U</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> norm is intrinsically linked to the second-order differential spectrum of a function. However, determining this spectrum is a notoriously difficult problem, and to date, it has only been solved for a few specific cases, such as the inverse function over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></mrow></msub></math></span> for <span><math><mi>n</mi><mo>=</mo><mn>6</mn><mo>,</mo><mn>8</mn></math></span> and the APN permutation over <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>6</mn></mrow></msubsup></math></span>. In this paper, we investigate the Gowers <span><math><msub><mrow><mi>U</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> norms of vectorial Boolean functions, with specific focus on five classes of cubic highly nonlinear power permutations over finite fields. We provide a comprehensive analysis of the Gowers <span><math><msub><mrow><mi>U</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> norm for the Welch function, the Modified Welch function, the cubic Kasami function, the Bracken-Leander function, and the Cusick-Dobbertin function. By characterizing the distribution of solutions for all second-order derivatives of these functions, we derive exact expressions for their Gowers <span><math><msub><mrow><mi>U</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> norms. Our results reveal quantitative differences in higher-order uniformity among these functions, with the Modified Welch function exhibiting a smaller Gowers <span><math><msub><mrow><mi>U</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> norm compared to the Welch and cubic Kasami functions. An
从F2n到F2m的向量布尔函数是理论计算机科学和数学中的基本对象。理解它们的结构,特别是如何很好地用低度函数来近似它们,在各种应用中是至关重要的,包括伪随机性、属性测试和密码学。在加性组合学中引入的高尔斯均匀性范数为这些目的提供了强有力的度量,作为近似的关键指标,在数学和理论计算机科学中具有重要的应用。虽然Gowers U2范数很好理解,但对高阶结构的分析,特别是k≥3的Gowers Uk范数,提出了重大挑战。实际上,Gowers U3范数的计算与函数的二阶微分谱有着内在的联系。然而,确定这个谱是一个众所周知的困难问题,到目前为止,它只解决了少数特定情况,例如n=6,8的F2n上的逆函数和F26上的APN排列。本文研究了向量布尔函数的Gowers U3范数,重点讨论了有限域上的五类三次高度非线性幂置换。本文对Welch函数、修正Welch函数、三次Kasami函数、Bracken-Leander函数和Cusick-Dobbertin函数的Gowers U3范数进行了综合分析。通过刻画这些函数的所有二阶导数的解的分布,我们得到了它们的Gowers U3范数的精确表达式。我们的研究结果揭示了这些函数之间高阶均匀性的定量差异,与Welch函数和三次Kasami函数相比,修正Welch函数显示出更小的Gowers U3范数。与逆函数相比,Bracken-Leander函数和Cusick-Dobbertin函数具有更大的Gowers U3范数。这些发现有助于更深入地理解这些高度非线性的功率排列。
{"title":"The Gowers U3 norm of five classes of power permutations","authors":"Zhaole Li,&nbsp;Deng Tang","doi":"10.1016/j.ffa.2026.102813","DOIUrl":"10.1016/j.ffa.2026.102813","url":null,"abstract":"&lt;div&gt;&lt;div&gt;Vectorial Boolean functions from &lt;span&gt;&lt;math&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;/math&gt;&lt;/span&gt; to &lt;span&gt;&lt;math&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;/math&gt;&lt;/span&gt; are fundamental objects in theoretical computer science and mathematics. Understanding their structure, particularly how well they can be approximated by low-degree functions, is crucial in various applications, including pseudorandomness, property testing, and cryptography. The Gowers uniformity norm, introduced in additive combinatorics, provides a powerful measure for these purposes, serving as a key indicator of the approximation and has significant applications in mathematics and theoretical computer science. While the Gowers &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;U&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; norm is well-understood, the analysis of higher-order structures, particularly the Gowers &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;U&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; norm for &lt;span&gt;&lt;math&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;≥&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;, poses significant challenges. Indeed, the computation of the Gowers &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;U&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; norm is intrinsically linked to the second-order differential spectrum of a function. However, determining this spectrum is a notoriously difficult problem, and to date, it has only been solved for a few specific cases, such as the inverse function over &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; for &lt;span&gt;&lt;math&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;6&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;8&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt; and the APN permutation over &lt;span&gt;&lt;math&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;6&lt;/mn&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;/math&gt;&lt;/span&gt;. In this paper, we investigate the Gowers &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;U&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; norms of vectorial Boolean functions, with specific focus on five classes of cubic highly nonlinear power permutations over finite fields. We provide a comprehensive analysis of the Gowers &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;U&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; norm for the Welch function, the Modified Welch function, the cubic Kasami function, the Bracken-Leander function, and the Cusick-Dobbertin function. By characterizing the distribution of solutions for all second-order derivatives of these functions, we derive exact expressions for their Gowers &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;U&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; norms. Our results reveal quantitative differences in higher-order uniformity among these functions, with the Modified Welch function exhibiting a smaller Gowers &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;U&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; norm compared to the Welch and cubic Kasami functions. An","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"112 ","pages":"Article 102813"},"PeriodicalIF":1.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Binary linear codes with at most three weights from cyclotomic mappings 从环切分映射得到的最多三个权值的二进制线性码
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-06-01 Epub Date: 2026-01-19 DOI: 10.1016/j.ffa.2026.102798
Heming Cui , Xubo Zhao , Qiang Wang , Xiaoping Li , Tongjiang Yan
Linear codes with few weights have attracted significant interest due to their wide-ranging applications in secret sharing, authentication codes, association schemes, strongly regular graph, and some other fields. This paper focuses on unifying several existing construction methods for few-weight linear codes, extending the works of Wang et al. (2015) [24], Wu et al. (2019) [25], and Fang et al. (2023) [10]. In our code construction, we introduce a novel index set J, whose cardinality and structural properties are shown to critically influence both the length and weight distribution of the resulting few-weight linear codes. By employing cyclotomic mappings and choosing the more general defining sets, several new classes of binary linear codes with at most three weights are constructed. Our framework subsumes all aforementioned constructions as special cases and enlarges the spectrum of attainable parameters. The weight distributions of the corresponding linear codes are also explicitly determined. We also demonstrate that some of the linear codes constructed in this paper are optimal in the sense that they have the best known parameters in the tables maintained by Markus Grassl and/or optimal in the sense that they meet certain bounds on linear codes.
低权重线性码由于其在秘密共享、认证码、关联方案、强正则图等领域的广泛应用而引起了人们的广泛关注。本文的重点是统一几种现有的小权重线性码的构建方法,扩展了Wang等人(2015)[24],Wu等人(2019)[25]和Fang等人(2023)[10]的工作。在我们的代码构造中,我们引入了一个新的索引集J,它的基数和结构性质被证明对得到的少权重线性代码的长度和权重分布都有重要影响。通过采用环切映射和选择更一般的定义集,构造了几种新的最多三个权重的二元线性码。我们的框架将所有上述结构作为特殊情况纳入,并扩大了可获得参数的范围。明确地确定了相应线性码的权值分布。我们还证明了本文构造的一些线性码是最优的,因为它们在Markus Grassl维护的表中具有最知名的参数,或者在满足线性码的某些界的意义上是最优的。
{"title":"Binary linear codes with at most three weights from cyclotomic mappings","authors":"Heming Cui ,&nbsp;Xubo Zhao ,&nbsp;Qiang Wang ,&nbsp;Xiaoping Li ,&nbsp;Tongjiang Yan","doi":"10.1016/j.ffa.2026.102798","DOIUrl":"10.1016/j.ffa.2026.102798","url":null,"abstract":"<div><div>Linear codes with few weights have attracted significant interest due to their wide-ranging applications in secret sharing, authentication codes, association schemes, strongly regular graph, and some other fields. This paper focuses on unifying several existing construction methods for few-weight linear codes, extending the works of Wang et al. (2015) <span><span>[24]</span></span>, Wu et al. (2019) <span><span>[25]</span></span>, and Fang et al. (2023) <span><span>[10]</span></span>. In our code construction, we introduce a novel index set <span><math><mi>J</mi></math></span>, whose cardinality and structural properties are shown to critically influence both the length and weight distribution of the resulting few-weight linear codes. By employing cyclotomic mappings and choosing the more general defining sets, several new classes of binary linear codes with at most three weights are constructed. Our framework subsumes all aforementioned constructions as special cases and enlarges the spectrum of attainable parameters. The weight distributions of the corresponding linear codes are also explicitly determined. We also demonstrate that some of the linear codes constructed in this paper are optimal in the sense that they have the best known parameters in the tables maintained by Markus Grassl and/or optimal in the sense that they meet certain bounds on linear codes.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"112 ","pages":"Article 102798"},"PeriodicalIF":1.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Permutation polynomials and involutions over the finite field F22m 有限域F22m上的置换多项式与对折
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-03-01 Epub Date: 2025-12-01 DOI: 10.1016/j.ffa.2025.102760
Liqin Qian , Minjia Shi , Xiwang Cao
In this paper, we propose several classes of permutation polynomials of the form j=1t(Trm2m(x)kj+δj)sj+L(x) over F22m, where L(x)=aTrm2m(x)+bx, aF22m and bF2m. The permutation behavior of the proposed polynomials is investigated by the AGW criterion and determination of the number of solutions to certain equations over F22m. Based on an effective method proposed by Mesnager (2014), we construct several classes of involutions and further obtain some self-dual bent functions by employing three permutations of F22m satisfying an algebraic property (A2m). Finally, it is worth pointing out that there exist examples of bent functions we obtained which do not belong to MM#.
本文提出了几类形式为∑j=1t(Trm2m(x)kj+δj)sj+L(x) / F22m的置换多项式,其中L(x)=aTrm2m(x)+bx, a∈F22m, b∈F2m。利用AGW准则和确定F22m上某些方程的解的个数,研究了所提出多项式的置换行为。在Mesnager(2014)提出的有效方法的基础上,利用满足代数性质(A2m)的F22m的三个排列,构造了几类对合,并进一步得到了一些自对偶弯曲函数。最后,值得指出的是,我们得到的弯曲函数也存在不属于mm#的例子。
{"title":"Permutation polynomials and involutions over the finite field F22m","authors":"Liqin Qian ,&nbsp;Minjia Shi ,&nbsp;Xiwang Cao","doi":"10.1016/j.ffa.2025.102760","DOIUrl":"10.1016/j.ffa.2025.102760","url":null,"abstract":"<div><div>In this paper, we propose several classes of permutation polynomials of the form <span><math><munderover><mo>∑</mo><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>t</mi></mrow></munderover><msup><mrow><mo>(</mo><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>m</mi></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msubsup><msup><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>j</mi></mrow></msub></mrow></msup><mo>+</mo><msub><mrow><mi>δ</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo></mrow><mrow><msub><mrow><mi>s</mi></mrow><mrow><mi>j</mi></mrow></msub></mrow></msup><mo>+</mo><mi>L</mi><mo>(</mo><mi>x</mi><mo>)</mo></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msup></mrow></msub></math></span>, where <span><math><mi>L</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>=</mo><mi>a</mi><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>m</mi></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msubsup><mo>(</mo><mi>x</mi><mo>)</mo><mo>+</mo><mi>b</mi><mi>x</mi></math></span>, <span><math><mi>a</mi><mo>∈</mo><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msup></mrow></msub></math></span> and <span><math><mi>b</mi><mo>∈</mo><msubsup><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup></mrow><mrow><mo>⁎</mo></mrow></msubsup></math></span>. The permutation behavior of the proposed polynomials is investigated by the AGW criterion and determination of the number of solutions to certain equations over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msup></mrow></msub></math></span>. Based on an effective method proposed by Mesnager (2014), we construct several classes of involutions and further obtain some self-dual bent functions by employing three permutations of <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msup></mrow></msub></math></span> satisfying an algebraic property <span><math><mo>(</mo><msub><mrow><mi>A</mi></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msub><mo>)</mo></math></span>. Finally, it is worth pointing out that there exist examples of bent functions we obtained which do not belong to <span><math><mi>M</mi><msup><mrow><mi>M</mi></mrow><mrow><mi>#</mi></mrow></msup></math></span>.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"111 ","pages":"Article 102760"},"PeriodicalIF":1.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145684472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Linear codes arising from the point-hyperplane geometry-Part I: The Segre embedding 由点超平面几何产生的线性码。第1部分:分段嵌入
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-03-01 Epub Date: 2025-12-02 DOI: 10.1016/j.ffa.2025.102766
I. Cardinali , L. Giuzzi
Let V be a vector space over the finite field Fq with q elements and Λ be the image of the Segre geometry PG(V)PG(V) in PG(VV) under the Segre map. Consider the subvariety Λ1 of Λ represented by the pure tensors xξ with xV and ξV such that ξ(x)=0. Regarding Λ1 as a projective system of PG(VV), we study the linear code C(Λ1) arising from it. We show that C(Λ1) is a minimal code and we determine its basic parameters, its full weight list and its linear automorphism group. We also give a geometrical characterization of its minimum and second lowest weight codewords as well as of some of the words of maximum weight.
设V为具有q个元素的有限域Fq上的向量空间,Λ为Segre几何图形PG(V)⊗PG(V)在PG(V V)中在Segre映射下的像。考虑由x∈V和ξ∈V的纯张量x⊗ξ表示的Λ的子变种Λ1,使得ξ(x)=0。将Λ1看作PG(V⊗V)的一个射影系统,研究了由此产生的线性代码C(Λ1)。我们证明了C(Λ1)是一个最小码,并确定了它的基本参数、它的全权表和它的线性自同构群。我们还给出了它的最小码字和次最小码字以及一些最大码字的几何特征。
{"title":"Linear codes arising from the point-hyperplane geometry-Part I: The Segre embedding","authors":"I. Cardinali ,&nbsp;L. Giuzzi","doi":"10.1016/j.ffa.2025.102766","DOIUrl":"10.1016/j.ffa.2025.102766","url":null,"abstract":"<div><div>Let <em>V</em> be a vector space over the finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> with <em>q</em> elements and Λ be the image of the Segre geometry <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>V</mi><mo>)</mo><mo>⊗</mo><mrow><mi>PG</mi></mrow><mo>(</mo><msup><mrow><mi>V</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>)</mo></math></span> in <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>V</mi><mo>⊗</mo><msup><mrow><mi>V</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>)</mo></math></span> under the Segre map. Consider the subvariety <span><math><msub><mrow><mi>Λ</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> of Λ represented by the pure tensors <span><math><mi>x</mi><mo>⊗</mo><mi>ξ</mi></math></span> with <span><math><mi>x</mi><mo>∈</mo><mi>V</mi></math></span> and <span><math><mi>ξ</mi><mo>∈</mo><msup><mrow><mi>V</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span> such that <span><math><mi>ξ</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span>. Regarding <span><math><msub><mrow><mi>Λ</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> as a projective system of <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>V</mi><mo>⊗</mo><msup><mrow><mi>V</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>)</mo></math></span>, we study the linear code <span><math><mi>C</mi><mo>(</mo><msub><mrow><mi>Λ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></math></span> arising from it. We show that <span><math><mi>C</mi><mo>(</mo><msub><mrow><mi>Λ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></math></span> is a minimal code and we determine its basic parameters, its full weight list and its linear automorphism group. We also give a geometrical characterization of its minimum and second lowest weight codewords as well as of some of the words of maximum weight.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"111 ","pages":"Article 102766"},"PeriodicalIF":1.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145684470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
One-weight codes in the sum-rank metric 一个权重在和秩度量中编码
IF 1.2 3区 数学 Q1 MATHEMATICS Pub Date : 2026-03-01 Epub Date: 2025-12-30 DOI: 10.1016/j.ffa.2025.102788
Usman Mushrraf, Ferdinando Zullo
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics—being equivalent to (direct sums of) simplex codes—the sum-rank metric presents a far more intricate landscape. In this work, we explore the geometry of one-weight sum-rank metric codes, focusing on three distinct classes. First, we introduce and classify constant rank-list sum-rank metric codes, where each nonzero codeword has the same tuple of ranks, extending results from the rank-metric setting. Next, we investigate the more general constant rank-profile codes, where, up to reordering, each nonzero codeword has the same tuple of ranks. Although a complete classification remains elusive, we present the first examples and partial structural results for this class. Finally, we consider one-weight codes that are also MSRD (Maximum Sum-Rank Distance) codes. For dimension two, constructions arise from partitions of scattered linear sets on projective lines. For dimension three, we connect their existence to that of special 2-fold blocking sets in the projective plane, leading to new bounds and nonexistence results over certain fields.
单权码是指所有非零码字具有相同权值的一种高度结构化的线性码,它与有限几何结构有着密切的联系。虽然它们的分类在Hamming和rank度量中得到了很好的理解——它们等价于单纯型代码的(直接和)——但和秩度量呈现了一个复杂得多的景观。在这项工作中,我们探讨了一权和秩度量码的几何,重点是三个不同的类别。首先,我们引入并分类了常数秩表和秩度量码,其中每个非零码字具有相同的秩元组,扩展了秩度量设置的结果。接下来,我们研究更一般的常数秩-配置码,其中,直到重新排序,每个非零码字具有相同的秩元组。虽然一个完整的分类仍然难以捉摸,我们提出了第一个例子和部分结构的结果为这类。最后,我们考虑单权码也是MSRD(最大和秩距离)码。对于第2维,构造是由投影线上分散的线性集的分割产生的。对于三维空间,我们将它们的存在性与射影平面上特殊的2重块集的存在性联系起来,得到了新的界和某些域上的不存在性结果。
{"title":"One-weight codes in the sum-rank metric","authors":"Usman Mushrraf,&nbsp;Ferdinando Zullo","doi":"10.1016/j.ffa.2025.102788","DOIUrl":"10.1016/j.ffa.2025.102788","url":null,"abstract":"<div><div>One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics—being equivalent to (direct sums of) simplex codes—the sum-rank metric presents a far more intricate landscape. In this work, we explore the geometry of one-weight sum-rank metric codes, focusing on three distinct classes. First, we introduce and classify <em>constant rank-list</em> sum-rank metric codes, where each nonzero codeword has the same tuple of ranks, extending results from the rank-metric setting. Next, we investigate the more general <em>constant rank-profile</em> codes, where, up to reordering, each nonzero codeword has the same tuple of ranks. Although a complete classification remains elusive, we present the first examples and partial structural results for this class. Finally, we consider one-weight codes that are also MSRD (Maximum Sum-Rank Distance) codes. For dimension two, constructions arise from partitions of scattered linear sets on projective lines. For dimension three, we connect their existence to that of special 2-fold blocking sets in the projective plane, leading to new bounds and nonexistence results over certain fields.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"111 ","pages":"Article 102788"},"PeriodicalIF":1.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145883542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Finite Fields and Their Applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1