特征为p的厄米曲线的伽罗瓦子盖关于dp阶具有$$d\not =p$$素数的子群

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Arianna Dionigi, Barbara Gatti
{"title":"特征为p的厄米曲线的伽罗瓦子盖关于dp阶具有$$d\\not =p$$素数的子群","authors":"Arianna Dionigi, Barbara Gatti","doi":"10.1007/s10623-025-01613-z","DOIUrl":null,"url":null,"abstract":"<p>A problem of current interest, also motivated by applications to Coding theory, is to find explicit equations for <i>maximal</i> curves, that are projective, geometrically irreducible, non-singular curves defined over a finite field <span>\\(\\mathbb {F}_{q^2}\\)</span> whose number of <span>\\(\\mathbb {F}_{q^2}\\)</span>-rational points attains the Hasse-Weil upper bound <span>\\(q^2+2\\mathfrak {g}q+1\\)</span> where <span>\\(\\mathfrak {g}\\)</span> is the genus of the curve <span>\\(\\mathcal {X}\\)</span>. For curves which are Galois covered of the Hermitian curve, this has been done so far ad hoc, in particular in the cases where the Galois group has prime order and also when has order the square of the characteristic. In this paper we obtain explicit equations of all Galois covers of the Hermitian curve with Galois group of order <i>dp</i> where <i>p</i> is the characteristic of <span>\\(\\mathbb {F}_{q^2}\\)</span> and <i>d</i> is a prime other than <i>p</i>. We also compute the generators of the Weierstrass semigroup at a special <span>\\(\\mathbb {F}_{q^2}\\)</span>-rational point of some of the curves, and discuss some possible positive impacts on the minimum distance problems of AG-codes.\n</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"68 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Galois subcovers of the Hermitian curve in characteristic p with respect to subgroups of order dp with $$d\\\\not =p$$ prime\",\"authors\":\"Arianna Dionigi, Barbara Gatti\",\"doi\":\"10.1007/s10623-025-01613-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A problem of current interest, also motivated by applications to Coding theory, is to find explicit equations for <i>maximal</i> curves, that are projective, geometrically irreducible, non-singular curves defined over a finite field <span>\\\\(\\\\mathbb {F}_{q^2}\\\\)</span> whose number of <span>\\\\(\\\\mathbb {F}_{q^2}\\\\)</span>-rational points attains the Hasse-Weil upper bound <span>\\\\(q^2+2\\\\mathfrak {g}q+1\\\\)</span> where <span>\\\\(\\\\mathfrak {g}\\\\)</span> is the genus of the curve <span>\\\\(\\\\mathcal {X}\\\\)</span>. For curves which are Galois covered of the Hermitian curve, this has been done so far ad hoc, in particular in the cases where the Galois group has prime order and also when has order the square of the characteristic. In this paper we obtain explicit equations of all Galois covers of the Hermitian curve with Galois group of order <i>dp</i> where <i>p</i> is the characteristic of <span>\\\\(\\\\mathbb {F}_{q^2}\\\\)</span> and <i>d</i> is a prime other than <i>p</i>. We also compute the generators of the Weierstrass semigroup at a special <span>\\\\(\\\\mathbb {F}_{q^2}\\\\)</span>-rational point of some of the curves, and discuss some possible positive impacts on the minimum distance problems of AG-codes.\\n</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"68 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2025-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-025-01613-z\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-025-01613-z","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

当前感兴趣的一个问题,也是由编码理论的应用所激发的,是找到最大曲线的显式方程,这些曲线是投影的,几何上不可约的,在有限域上定义的非奇异曲线\(\mathbb {F}_{q^2}\),其\(\mathbb {F}_{q^2}\) -有理点的数量达到Hasse-Weil上界\(q^2+2\mathfrak {g}q+1\),其中\(\mathfrak {g}\)是曲线的属\(\mathcal {X}\)。对于伽罗瓦曲线覆盖的厄米曲线,到目前为止,这是专门做的,特别是在伽罗瓦群是素数阶的情况下以及当特征的平方是有序的情况下。本文得到了具有dp阶伽罗瓦群的埃尔密曲线的所有伽罗瓦覆盖的显式方程,其中p是\(\mathbb {F}_{q^2}\)的特征,d是p以外的素数。我们还计算了在某些曲线的一个特殊的\(\mathbb {F}_{q^2}\) -有理点上的Weierstrass半群的生成器,并讨论了一些可能对agg码的最小距离问题的积极影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Galois subcovers of the Hermitian curve in characteristic p with respect to subgroups of order dp with $$d\not =p$$ prime

A problem of current interest, also motivated by applications to Coding theory, is to find explicit equations for maximal curves, that are projective, geometrically irreducible, non-singular curves defined over a finite field \(\mathbb {F}_{q^2}\) whose number of \(\mathbb {F}_{q^2}\)-rational points attains the Hasse-Weil upper bound \(q^2+2\mathfrak {g}q+1\) where \(\mathfrak {g}\) is the genus of the curve \(\mathcal {X}\). For curves which are Galois covered of the Hermitian curve, this has been done so far ad hoc, in particular in the cases where the Galois group has prime order and also when has order the square of the characteristic. In this paper we obtain explicit equations of all Galois covers of the Hermitian curve with Galois group of order dp where p is the characteristic of \(\mathbb {F}_{q^2}\) and d is a prime other than p. We also compute the generators of the Weierstrass semigroup at a special \(\mathbb {F}_{q^2}\)-rational point of some of the curves, and discuss some possible positive impacts on the minimum distance problems of AG-codes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信