{"title":"二次旋转对称四次布尔函数的权值递归","authors":"T. Cusick, Younhwan Cheon","doi":"10.3934/AMC.2021011","DOIUrl":null,"url":null,"abstract":"A Boolean function in \\begin{document}$ n $\\end{document} variables is 2-rotation symmetric if it is invariant under even powers of \\begin{document}$ \\rho(x_1, \\ldots, x_n) = (x_2, \\ldots, x_n, x_1) $\\end{document} , but not under the first power (ordinary rotation symmetry); we call such a function a 2-function. A 2-function is called monomial rotation symmetric (MRS) if it is generated by applying powers of \\begin{document}$ \\rho^2 $\\end{document} to a single monomial. If the quartic MRS 2-function in \\begin{document}$ 2n $\\end{document} variables has a monomial \\begin{document}$ x_1 x_q x_r x_s $\\end{document} , then we use the notation \\begin{document}$ {2-}(1,q,r,s)_{2n} $\\end{document} for the function. A detailed theory of equivalence of quartic MRS 2-functions in \\begin{document}$ 2n $\\end{document} variables was given in a \\begin{document}$ 2020 $\\end{document} paper by Cusick, Cheon and Dougan. This theory divides naturally into two classes, called \\begin{document}$ mf1 $\\end{document} and \\begin{document}$ mf2 $\\end{document} in the paper. After describing the equivalence classes, the second major problem is giving details of the linear recursions that the Hamming weights for any sequence of functions \\begin{document}$ {2-}(1,q,r,s)_{2n} $\\end{document} (with \\begin{document}$ q say), \\begin{document}$ n = s, s+1, \\ldots $\\end{document} can be shown to satisfy. This problem was solved for the \\begin{document}$ mf1 $\\end{document} case only in the \\begin{document}$ 2020 $\\end{document} paper. Using new ideas about \"short\" functions, Cusick and Cheon found formulas for the \\begin{document}$ mf2 $\\end{document} weights in a \\begin{document}$ 2021 $\\end{document} sequel to the \\begin{document}$ 2020 $\\end{document} paper. In this paper the actual recursions for the weights in the \\begin{document}$ mf2 $\\end{document} case are determined.","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\":\"The weight recursions for the 2-rotation symmetric quartic Boolean functions\",\"authors\":\"T. Cusick, Younhwan Cheon\",\"doi\":\"10.3934/AMC.2021011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Boolean function in \\\\begin{document}$ n $\\\\end{document} variables is 2-rotation symmetric if it is invariant under even powers of \\\\begin{document}$ \\\\rho(x_1, \\\\ldots, x_n) = (x_2, \\\\ldots, x_n, x_1) $\\\\end{document} , but not under the first power (ordinary rotation symmetry); we call such a function a 2-function. A 2-function is called monomial rotation symmetric (MRS) if it is generated by applying powers of \\\\begin{document}$ \\\\rho^2 $\\\\end{document} to a single monomial. If the quartic MRS 2-function in \\\\begin{document}$ 2n $\\\\end{document} variables has a monomial \\\\begin{document}$ x_1 x_q x_r x_s $\\\\end{document} , then we use the notation \\\\begin{document}$ {2-}(1,q,r,s)_{2n} $\\\\end{document} for the function. A detailed theory of equivalence of quartic MRS 2-functions in \\\\begin{document}$ 2n $\\\\end{document} variables was given in a \\\\begin{document}$ 2020 $\\\\end{document} paper by Cusick, Cheon and Dougan. This theory divides naturally into two classes, called \\\\begin{document}$ mf1 $\\\\end{document} and \\\\begin{document}$ mf2 $\\\\end{document} in the paper. After describing the equivalence classes, the second major problem is giving details of the linear recursions that the Hamming weights for any sequence of functions \\\\begin{document}$ {2-}(1,q,r,s)_{2n} $\\\\end{document} (with \\\\begin{document}$ q say), \\\\begin{document}$ n = s, s+1, \\\\ldots $\\\\end{document} can be shown to satisfy. This problem was solved for the \\\\begin{document}$ mf1 $\\\\end{document} case only in the \\\\begin{document}$ 2020 $\\\\end{document} paper. Using new ideas about \\\"short\\\" functions, Cusick and Cheon found formulas for the \\\\begin{document}$ mf2 $\\\\end{document} weights in a \\\\begin{document}$ 2021 $\\\\end{document} sequel to the \\\\begin{document}$ 2020 $\\\\end{document} paper. In this paper the actual recursions for the weights in the \\\\begin{document}$ mf2 $\\\\end{document} case are determined.\",\"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.2021011\",\"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.2021011","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
The weight recursions for the 2-rotation symmetric quartic Boolean functions
A Boolean function in \begin{document}$ n $\end{document} variables is 2-rotation symmetric if it is invariant under even powers of \begin{document}$ \rho(x_1, \ldots, x_n) = (x_2, \ldots, x_n, x_1) $\end{document} , but not under the first power (ordinary rotation symmetry); we call such a function a 2-function. A 2-function is called monomial rotation symmetric (MRS) if it is generated by applying powers of \begin{document}$ \rho^2 $\end{document} to a single monomial. If the quartic MRS 2-function in \begin{document}$ 2n $\end{document} variables has a monomial \begin{document}$ x_1 x_q x_r x_s $\end{document} , then we use the notation \begin{document}$ {2-}(1,q,r,s)_{2n} $\end{document} for the function. A detailed theory of equivalence of quartic MRS 2-functions in \begin{document}$ 2n $\end{document} variables was given in a \begin{document}$ 2020 $\end{document} paper by Cusick, Cheon and Dougan. This theory divides naturally into two classes, called \begin{document}$ mf1 $\end{document} and \begin{document}$ mf2 $\end{document} in the paper. After describing the equivalence classes, the second major problem is giving details of the linear recursions that the Hamming weights for any sequence of functions \begin{document}$ {2-}(1,q,r,s)_{2n} $\end{document} (with \begin{document}$ q say), \begin{document}$ n = s, s+1, \ldots $\end{document} can be shown to satisfy. This problem was solved for the \begin{document}$ mf1 $\end{document} case only in the \begin{document}$ 2020 $\end{document} paper. Using new ideas about "short" functions, Cusick and Cheon found formulas for the \begin{document}$ mf2 $\end{document} weights in a \begin{document}$ 2021 $\end{document} sequel to the \begin{document}$ 2020 $\end{document} paper. In this paper the actual recursions for the weights in the \begin{document}$ mf2 $\end{document} case are determined.
期刊介绍:
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.