{"title":"最小距离为4的最优五元负循环码","authors":"Jinmei Fan, Yanhai Zhang","doi":"10.3934/amc.2021043","DOIUrl":null,"url":null,"abstract":"<p style='text-indent:20px;'>Based on solutions of certain equations over finite yields, a necessary and sufficient condition for the quinary negacyclic codes with parameters <inline-formula><tex-math id=\"M1\">\\begin{document}$ [\\frac{5^m-1}{2},\\frac{5^m-1}{2}-2m,4] $\\end{document}</tex-math></inline-formula> to have generator polynomial <inline-formula><tex-math id=\"M2\">\\begin{document}$ m_{\\alpha^3}(x)m_{\\alpha^e}(x) $\\end{document}</tex-math></inline-formula> is provided. Several classes of new optimal quinary negacyclic codes with the same parameters are constructed by analyzing irreducible factors of certain polynomials over finite fields. Moreover, several classes of new optimal quinary negacyclic codes with these parameters and generator polynomial <inline-formula><tex-math id=\"M3\">\\begin{document}$ m_{\\alpha}(x)m_{\\alpha^e}(x) $\\end{document}</tex-math></inline-formula> are also presented.</p>","PeriodicalId":50859,"journal":{"name":"Advances in Mathematics of Communications","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal quinary negacyclic codes with minimum distance four\",\"authors\":\"Jinmei Fan, Yanhai Zhang\",\"doi\":\"10.3934/amc.2021043\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p style='text-indent:20px;'>Based on solutions of certain equations over finite yields, a necessary and sufficient condition for the quinary negacyclic codes with parameters <inline-formula><tex-math id=\\\"M1\\\">\\\\begin{document}$ [\\\\frac{5^m-1}{2},\\\\frac{5^m-1}{2}-2m,4] $\\\\end{document}</tex-math></inline-formula> to have generator polynomial <inline-formula><tex-math id=\\\"M2\\\">\\\\begin{document}$ m_{\\\\alpha^3}(x)m_{\\\\alpha^e}(x) $\\\\end{document}</tex-math></inline-formula> is provided. Several classes of new optimal quinary negacyclic codes with the same parameters are constructed by analyzing irreducible factors of certain polynomials over finite fields. Moreover, several classes of new optimal quinary negacyclic codes with these parameters and generator polynomial <inline-formula><tex-math id=\\\"M3\\\">\\\\begin{document}$ m_{\\\\alpha}(x)m_{\\\\alpha^e}(x) $\\\\end{document}</tex-math></inline-formula> are also presented.</p>\",\"PeriodicalId\":50859,\"journal\":{\"name\":\"Advances in Mathematics of Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mathematics of Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3934/amc.2021043\",\"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.2021043","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
Based on solutions of certain equations over finite yields, a necessary and sufficient condition for the quinary negacyclic codes with parameters \begin{document}$ [\frac{5^m-1}{2},\frac{5^m-1}{2}-2m,4] $\end{document} to have generator polynomial \begin{document}$ m_{\alpha^3}(x)m_{\alpha^e}(x) $\end{document} is provided. Several classes of new optimal quinary negacyclic codes with the same parameters are constructed by analyzing irreducible factors of certain polynomials over finite fields. Moreover, several classes of new optimal quinary negacyclic codes with these parameters and generator polynomial \begin{document}$ m_{\alpha}(x)m_{\alpha^e}(x) $\end{document} are also presented.
Optimal quinary negacyclic codes with minimum distance four
Based on solutions of certain equations over finite yields, a necessary and sufficient condition for the quinary negacyclic codes with parameters \begin{document}$ [\frac{5^m-1}{2},\frac{5^m-1}{2}-2m,4] $\end{document} to have generator polynomial \begin{document}$ m_{\alpha^3}(x)m_{\alpha^e}(x) $\end{document} is provided. Several classes of new optimal quinary negacyclic codes with the same parameters are constructed by analyzing irreducible factors of certain polynomials over finite fields. Moreover, several classes of new optimal quinary negacyclic codes with these parameters and generator polynomial \begin{document}$ m_{\alpha}(x)m_{\alpha^e}(x) $\end{document} are also presented.
期刊介绍:
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.