Rong Luo, Mingliang Yan, Sihem Mesnager, Dongchun Han
{"title":"On Abelian one-dimensional hull codes in group algebras","authors":"Rong Luo, Mingliang Yan, Sihem Mesnager, Dongchun Han","doi":"10.1007/s10623-024-01504-9","DOIUrl":null,"url":null,"abstract":"<p>This paper focuses on hull dimensional codes obtained by the intersection of linear codes and their dual. These codes were introduced by Assmus and Key and have been the subject of significant theoretical and practical research over the years, gaining increased attention in recent years. Let <span>\\(\\mathbb {F}_q\\)</span> denote the finite field with <i>q</i> elements, and let <i>G</i> be a finite Abelian group of order <i>n</i>. The paper investigates Abelian codes defined as ideals of the group algebra <span>\\(\\mathbb {F}_qG\\)</span> with coefficients in <span>\\(\\mathbb {F}_q\\)</span>. Specifically, it delves into Abelian hull dimensional codes in the group algebra <span>\\(\\mathbb {F}_qG\\)</span>, where <i>G</i> is a finite Abelian group of order <i>n</i> with <span>\\(\\gcd (n,q)=1\\)</span>. Specifically, we first examine general hull Abelian codes and then narrow its focus to Abelian one-dimensional hull codes. Next, we focus on Abelian one-dimensional hull codes and present some necessary and sufficient conditions for characterizing them. Consequently, we generalize a recent result on Abelian codes and show that no binary or ternary Abelian codes with one-dimensional hulls exist. Furthermore, we construct Abelian codes with one-dimensional hulls by generating idempotents, derive optimal ones with one-dimensional hulls, and establish several existing results of Abelian codes with one-dimensional hulls. Finally, we develop enumeration results through a simple formula that counts Abelian codes with one-dimensional hulls in <span>\\(\\mathbb {F}_qG\\)</span>. These achievements exploit the rich algebraic structure of those Abelian codes and enhance and increase our knowledge of them by considering their hull dimensions, reducing the gap between their interests and our understanding of them.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"10 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-10-03","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-01504-9","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
This paper focuses on hull dimensional codes obtained by the intersection of linear codes and their dual. These codes were introduced by Assmus and Key and have been the subject of significant theoretical and practical research over the years, gaining increased attention in recent years. Let \(\mathbb {F}_q\) denote the finite field with q elements, and let G be a finite Abelian group of order n. The paper investigates Abelian codes defined as ideals of the group algebra \(\mathbb {F}_qG\) with coefficients in \(\mathbb {F}_q\). Specifically, it delves into Abelian hull dimensional codes in the group algebra \(\mathbb {F}_qG\), where G is a finite Abelian group of order n with \(\gcd (n,q)=1\). Specifically, we first examine general hull Abelian codes and then narrow its focus to Abelian one-dimensional hull codes. Next, we focus on Abelian one-dimensional hull codes and present some necessary and sufficient conditions for characterizing them. Consequently, we generalize a recent result on Abelian codes and show that no binary or ternary Abelian codes with one-dimensional hulls exist. Furthermore, we construct Abelian codes with one-dimensional hulls by generating idempotents, derive optimal ones with one-dimensional hulls, and establish several existing results of Abelian codes with one-dimensional hulls. Finally, we develop enumeration results through a simple formula that counts Abelian codes with one-dimensional hulls in \(\mathbb {F}_qG\). These achievements exploit the rich algebraic structure of those Abelian codes and enhance and increase our knowledge of them by considering their hull dimensions, reducing the gap between their interests and our understanding of them.
期刊介绍:
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.