Codes over $$\mathbb {F}_4$$ and $$\mathbb {F}_2 \times \mathbb {F}_2$$ and theta series of the corresponding lattices in quadratic fields

IF 1.2 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-12-04 DOI:10.1007/s10623-024-01537-0
Josline Freed
{"title":"Codes over $$\\mathbb {F}_4$$ and $$\\mathbb {F}_2 \\times \\mathbb {F}_2$$ and theta series of the corresponding lattices in quadratic fields","authors":"Josline Freed","doi":"10.1007/s10623-024-01537-0","DOIUrl":null,"url":null,"abstract":"<p>Using codes defined over <span>\\(\\mathbb {F}_4\\)</span> and <span>\\(\\mathbb {F}_2 \\times \\mathbb {F}_2\\)</span>, we simultaneously define the theta series of corresponding lattices for both real and imaginary quadratic fields <span>\\(\\mathbb {Q}(\\sqrt{d})\\)</span> with <span>\\(d \\equiv 1\\mod 4\\)</span> a square-free integer. For such a code, we use its weight enumerator to prove which term in the code’s corresponding theta series is the first to depend on the choice of <i>d</i>. For a given choice of real or imaginary quadratic field, we find conditions on the length of the code relative to the choice of quadratic field. When these conditions are satisfied, the generated theta series is unique to the code’s symmetric weight enumerator. We show that whilst these conditions ensure all non-equivalent codes will produce distinct theta series, for other codes that do not satisfy this condition, the length of the code and choice of quadratic field is not always enough to determine if the corresponding theta series will be unique.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"29 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2024-12-04","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-01537-0","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Using codes defined over \(\mathbb {F}_4\) and \(\mathbb {F}_2 \times \mathbb {F}_2\), we simultaneously define the theta series of corresponding lattices for both real and imaginary quadratic fields \(\mathbb {Q}(\sqrt{d})\) with \(d \equiv 1\mod 4\) a square-free integer. For such a code, we use its weight enumerator to prove which term in the code’s corresponding theta series is the first to depend on the choice of d. For a given choice of real or imaginary quadratic field, we find conditions on the length of the code relative to the choice of quadratic field. When these conditions are satisfied, the generated theta series is unique to the code’s symmetric weight enumerator. We show that whilst these conditions ensure all non-equivalent codes will produce distinct theta series, for other codes that do not satisfy this condition, the length of the code and choice of quadratic field is not always enough to determine if the corresponding theta series will be unique.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二次域中对应格的$$\mathbb {F}_4$$和$$\mathbb {F}_2 \times \mathbb {F}_2$$上的代码和级数
使用在\(\mathbb {F}_4\)和\(\mathbb {F}_2 \times \mathbb {F}_2\)上定义的代码,我们同时定义了实二次域和虚二次域\(\mathbb {Q}(\sqrt{d})\)对应格的theta级数,其中\(d \equiv 1\mod 4\)是一个无平方整数。对于这样的码,我们使用它的权数枚举器来证明码对应的θ级数中哪一项首先依赖于d的选择。对于给定的实或虚二次域的选择,我们找到了相对于二次域选择的码的长度的条件。当满足这些条件时,生成的theta级数对于代码的对称权重枚举数是唯一的。我们表明,虽然这些条件确保所有非等效码将产生不同的θ级数,但对于不满足此条件的其他码,码的长度和二次域的选择并不总是足以确定相应的θ级数是否唯一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Weight distributions of two classes of optimal $$(r{,}\delta )$$-locally repairable codes On flag-transitive 2-designs with prime block length and projective special linear groups Intersective sets over abelian groups Packing designs with large block size Characterization of some minihypers in $${{\,\textrm{PG}\,}}(r,3)$$ and the nonexistence of some ternary Griesmer codes
×
引用
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