提升等二代数几何代码

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
María Chara, Ricardo Podestá, Luciane Quoos, Ricardo Toledano
{"title":"提升等二代数几何代码","authors":"María Chara, Ricardo Podestá, Luciane Quoos, Ricardo Toledano","doi":"10.1007/s10623-024-01412-y","DOIUrl":null,"url":null,"abstract":"<p>In this work we investigate the problem of producing iso-dual algebraic geometry (AG) codes over a finite field <span>\\(\\mathbb {F}_{q}\\)</span> with <i>q</i> elements. Given a finite separable extension <span>\\(\\mathcal {M}/\\mathcal {F}\\)</span> of function fields and an iso-dual AG-code <span>\\(\\mathcal {C}\\)</span> defined over <span>\\(\\mathcal {F}\\)</span>, we provide a general method to lift the code <span>\\(\\mathcal {C}\\)</span> to another iso-dual AG-code <span>\\(\\tilde{\\mathcal {C}}\\)</span> defined over <span>\\(\\mathcal {M}\\)</span> under some assumptions on the parity of the involved different exponents. We apply this method to lift iso-dual AG-codes over the rational function field to elementary abelian <i>p</i>-extensions, like the maximal function fields defined by the Hermitian, Suzuki, and one covered by the <i>GGS</i> function field. We also obtain long binary and ternary iso-dual AG-codes defined over cyclotomic extensions.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"392 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lifting iso-dual algebraic geometry codes\",\"authors\":\"María Chara, Ricardo Podestá, Luciane Quoos, Ricardo Toledano\",\"doi\":\"10.1007/s10623-024-01412-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this work we investigate the problem of producing iso-dual algebraic geometry (AG) codes over a finite field <span>\\\\(\\\\mathbb {F}_{q}\\\\)</span> with <i>q</i> elements. Given a finite separable extension <span>\\\\(\\\\mathcal {M}/\\\\mathcal {F}\\\\)</span> of function fields and an iso-dual AG-code <span>\\\\(\\\\mathcal {C}\\\\)</span> defined over <span>\\\\(\\\\mathcal {F}\\\\)</span>, we provide a general method to lift the code <span>\\\\(\\\\mathcal {C}\\\\)</span> to another iso-dual AG-code <span>\\\\(\\\\tilde{\\\\mathcal {C}}\\\\)</span> defined over <span>\\\\(\\\\mathcal {M}\\\\)</span> under some assumptions on the parity of the involved different exponents. We apply this method to lift iso-dual AG-codes over the rational function field to elementary abelian <i>p</i>-extensions, like the maximal function fields defined by the Hermitian, Suzuki, and one covered by the <i>GGS</i> function field. We also obtain long binary and ternary iso-dual AG-codes defined over cyclotomic extensions.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"392 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-05-07\",\"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-024-01412-y\",\"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-024-01412-y","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

在这项工作中,我们研究了在具有 q 个元素的有限域 \(\mathbb {F}_{q}\) 上生成等双代数几何(AG)代码的问题。给定函数域的有限可分离扩展 \(\mathcal {M}/\mathcal {F}\) 和定义在 \(\mathcal {F}\) 上的等双 AG 代码 \(\mathcal {C}\)、我们提供了一种一般方法,在对所涉及的不同指数的奇偶性做一些假设的情况下,将代码 \(\mathcal {C}\) 提升到定义在 \(\mathcal {M}\) 上的另一个等双 AG 代码 \(\tilde/{mathcal {C}\) 。我们应用这种方法把有理函数域上的等双 AG 代码提升到基本无住民 p 扩展,比如由赫尔墨斯、铃木和一个由 GGS 函数域覆盖的最大函数域定义的等双 AG 代码。我们还获得了定义在环函扩展上的长二元和三元等双 AG 代码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Lifting iso-dual algebraic geometry codes

Lifting iso-dual algebraic geometry codes

In this work we investigate the problem of producing iso-dual algebraic geometry (AG) codes over a finite field \(\mathbb {F}_{q}\) with q elements. Given a finite separable extension \(\mathcal {M}/\mathcal {F}\) of function fields and an iso-dual AG-code \(\mathcal {C}\) defined over \(\mathcal {F}\), we provide a general method to lift the code \(\mathcal {C}\) to another iso-dual AG-code \(\tilde{\mathcal {C}}\) defined over \(\mathcal {M}\) under some assumptions on the parity of the involved different exponents. We apply this method to lift iso-dual AG-codes over the rational function field to elementary abelian p-extensions, like the maximal function fields defined by the Hermitian, Suzuki, and one covered by the GGS function field. We also obtain long binary and ternary iso-dual AG-codes defined over cyclotomic extensions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信