{"title":"On quasi-twisted codes and generalized quasi-twisted codes over $$\\mathbb {Z}_{4} +u\\mathbb {Z}_{4}$$","authors":"Ayoub Mounir, Abdelfattah Haily","doi":"10.1007/s12095-024-00732-z","DOIUrl":null,"url":null,"abstract":"<p>In this paper, our main objective is to examine the properties and characteristics of 1-generator <span>\\((2 + u)\\)</span>-quasi-twisted (QT) codes and <span>\\((2 + u)\\)</span>-generalized quasi-twisted (GQT) codes over the ring <span>\\(\\mathbb {Z}_4 +u\\mathbb {Z}_4 \\)</span>, with <span>\\(u^2=1\\)</span>. We determine the structure of the generators and minimal generating sets for both 1-generator <span>\\((2 + u)\\)</span>-QT and <span>\\((2 + u)\\)</span>-GQT codes. Additionally, we establish a lower bound for the minimum distance of free 1-generator <span>\\((2 + u)\\)</span>-QT and <span>\\((2 + u)\\)</span>-GQT codes over <i>R</i>. Furthermore, we present some numerical examples that illustrate the construction of some optimal <span>\\(\\mathbb {Z}_4\\)</span>-linear codes using the Gray map.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"112 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s12095-024-00732-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, our main objective is to examine the properties and characteristics of 1-generator \((2 + u)\)-quasi-twisted (QT) codes and \((2 + u)\)-generalized quasi-twisted (GQT) codes over the ring \(\mathbb {Z}_4 +u\mathbb {Z}_4 \), with \(u^2=1\). We determine the structure of the generators and minimal generating sets for both 1-generator \((2 + u)\)-QT and \((2 + u)\)-GQT codes. Additionally, we establish a lower bound for the minimum distance of free 1-generator \((2 + u)\)-QT and \((2 + u)\)-GQT codes over R. Furthermore, we present some numerical examples that illustrate the construction of some optimal \(\mathbb {Z}_4\)-linear codes using the Gray map.