{"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.4000,"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.
期刊介绍:
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.