{"title":"关于$ \\mathbb{Z}_4\\mathbb{Z}_4[u^3] $-加性常循环码","authors":"O. Prakash, S. Yadav, H. Islam, P. Solé","doi":"10.3934/amc.2022017","DOIUrl":null,"url":null,"abstract":"<p style='text-indent:20px;'>Let <inline-formula><tex-math id=\"M2\">\\begin{document}$ \\mathbb{Z}_4 $\\end{document}</tex-math></inline-formula> be the ring of integers modulo <inline-formula><tex-math id=\"M3\">\\begin{document}$ 4 $\\end{document}</tex-math></inline-formula>. This paper studies mixed alphabets <inline-formula><tex-math id=\"M4\">\\begin{document}$ \\mathbb{Z}_4\\mathbb{Z}_4[u^3] $\\end{document}</tex-math></inline-formula>-additive cyclic and <inline-formula><tex-math id=\"M5\">\\begin{document}$ \\lambda $\\end{document}</tex-math></inline-formula>-constacyclic codes for units <inline-formula><tex-math id=\"M6\">\\begin{document}$ \\lambda = 1+2u^2,3+2u^2 $\\end{document}</tex-math></inline-formula>. First, we obtain the generator polynomials and minimal generating set of additive cyclic codes. Then we extend our study to determine the structure of additive constacyclic codes. Further, we define some Gray maps and obtain <inline-formula><tex-math id=\"M7\">\\begin{document}$ \\mathbb{Z}_4 $\\end{document}</tex-math></inline-formula>-images of such codes. Finally, we present numerical examples that include six new and two best-known quaternary linear codes.</p>","PeriodicalId":50859,"journal":{"name":"Advances in Mathematics of Communications","volume":"13 1","pages":"246-261"},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On $ \\\\mathbb{Z}_4\\\\mathbb{Z}_4[u^3] $-additive constacyclic codes\",\"authors\":\"O. Prakash, S. Yadav, H. Islam, P. Solé\",\"doi\":\"10.3934/amc.2022017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p style='text-indent:20px;'>Let <inline-formula><tex-math id=\\\"M2\\\">\\\\begin{document}$ \\\\mathbb{Z}_4 $\\\\end{document}</tex-math></inline-formula> be the ring of integers modulo <inline-formula><tex-math id=\\\"M3\\\">\\\\begin{document}$ 4 $\\\\end{document}</tex-math></inline-formula>. This paper studies mixed alphabets <inline-formula><tex-math id=\\\"M4\\\">\\\\begin{document}$ \\\\mathbb{Z}_4\\\\mathbb{Z}_4[u^3] $\\\\end{document}</tex-math></inline-formula>-additive cyclic and <inline-formula><tex-math id=\\\"M5\\\">\\\\begin{document}$ \\\\lambda $\\\\end{document}</tex-math></inline-formula>-constacyclic codes for units <inline-formula><tex-math id=\\\"M6\\\">\\\\begin{document}$ \\\\lambda = 1+2u^2,3+2u^2 $\\\\end{document}</tex-math></inline-formula>. First, we obtain the generator polynomials and minimal generating set of additive cyclic codes. Then we extend our study to determine the structure of additive constacyclic codes. Further, we define some Gray maps and obtain <inline-formula><tex-math id=\\\"M7\\\">\\\\begin{document}$ \\\\mathbb{Z}_4 $\\\\end{document}</tex-math></inline-formula>-images of such codes. Finally, we present numerical examples that include six new and two best-known quaternary linear codes.</p>\",\"PeriodicalId\":50859,\"journal\":{\"name\":\"Advances in Mathematics of Communications\",\"volume\":\"13 1\",\"pages\":\"246-261\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mathematics of Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3934/amc.2022017\",\"RegionNum\":4,\"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":"Advances in Mathematics of Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3934/amc.2022017","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1
摘要
Let \begin{document}$ \mathbb{Z}_4 $\end{document} be the ring of integers modulo \begin{document}$ 4 $\end{document}. This paper studies mixed alphabets \begin{document}$ \mathbb{Z}_4\mathbb{Z}_4[u^3] $\end{document}-additive cyclic and \begin{document}$ \lambda $\end{document}-constacyclic codes for units \begin{document}$ \lambda = 1+2u^2,3+2u^2 $\end{document}. First, we obtain the generator polynomials and minimal generating set of additive cyclic codes. Then we extend our study to determine the structure of additive constacyclic codes. Further, we define some Gray maps and obtain \begin{document}$ \mathbb{Z}_4 $\end{document}-images of such codes. Finally, we present numerical examples that include six new and two best-known quaternary linear codes.
On $ \mathbb{Z}_4\mathbb{Z}_4[u^3] $-additive constacyclic codes
Let \begin{document}$ \mathbb{Z}_4 $\end{document} be the ring of integers modulo \begin{document}$ 4 $\end{document}. This paper studies mixed alphabets \begin{document}$ \mathbb{Z}_4\mathbb{Z}_4[u^3] $\end{document}-additive cyclic and \begin{document}$ \lambda $\end{document}-constacyclic codes for units \begin{document}$ \lambda = 1+2u^2,3+2u^2 $\end{document}. First, we obtain the generator polynomials and minimal generating set of additive cyclic codes. Then we extend our study to determine the structure of additive constacyclic codes. Further, we define some Gray maps and obtain \begin{document}$ \mathbb{Z}_4 $\end{document}-images of such codes. Finally, we present numerical examples that include six new and two best-known quaternary linear codes.
期刊介绍:
Advances in Mathematics of Communications (AMC) publishes original research papers of the highest quality in all areas of mathematics and computer science which are relevant to applications in communications technology. For this reason, submissions from many areas of mathematics are invited, provided these show a high level of originality, new techniques, an innovative approach, novel methodologies, or otherwise a high level of depth and sophistication. Any work that does not conform to these standards will be rejected.
Areas covered include coding theory, cryptology, combinatorics, finite geometry, algebra and number theory, but are not restricted to these. This journal also aims to cover the algorithmic and computational aspects of these disciplines. Hence, all mathematics and computer science contributions of appropriate depth and relevance to the above mentioned applications in communications technology are welcome.
More detailed indication of the journal''s scope is given by the subject interests of the members of the board of editors.