{"title":"On the correlation measures of orders $ 3 $ and $ 4 $ of binary sequence of period $ p^2 $ derived from Fermat quotients","authors":"Huaning Liu, Xi Liu","doi":"10.3934/AMC.2021008","DOIUrl":null,"url":null,"abstract":"Let \\begin{document}$ p $\\end{document} be a prime and let \\begin{document}$ n $\\end{document} be an integer with \\begin{document}$ (n, p) = 1 $\\end{document} . The Fermat quotient \\begin{document}$ q_p(n) $\\end{document} is defined as \\begin{document}$ q_p(n)\\equiv \\frac{n^{p-1}-1}{p} \\ (\\bmod\\ p), \\quad 0\\leq q_p(n)\\leq p-1. $\\end{document} We also define \\begin{document}$ q_p(kp) = 0 $\\end{document} for \\begin{document}$ k\\in \\mathbb{Z} $\\end{document} . Chen, Ostafe and Winterhof constructed the binary sequence \\begin{document}$ E_{p^2} = \\left(e_0, e_1, \\cdots, e_{p^2-1}\\right)\\in \\{0, 1\\}^{p^2} $\\end{document} as \\begin{document}$ \\begin{equation*} \\begin{split} e_{n} = \\left\\{\\begin{array}{ll} 0, & \\hbox{if }\\ 0\\leq \\frac{q_p(n)}{p} and studied the well-distribution measure and correlation measure of order \\begin{document}$ 2 $\\end{document} by using estimates for exponential sums of Fermat quotients. In this paper we further study the correlation measures of the sequence. Our results show that the correlation measure of order \\begin{document}$ 3 $\\end{document} is quite good, but the \\begin{document}$ 4 $\\end{document} -order correlation measure of the sequence is very large.","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":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mathematics of Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3934/AMC.2021008","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1
Abstract
Let \begin{document}$ p $\end{document} be a prime and let \begin{document}$ n $\end{document} be an integer with \begin{document}$ (n, p) = 1 $\end{document} . The Fermat quotient \begin{document}$ q_p(n) $\end{document} is defined as \begin{document}$ q_p(n)\equiv \frac{n^{p-1}-1}{p} \ (\bmod\ p), \quad 0\leq q_p(n)\leq p-1. $\end{document} We also define \begin{document}$ q_p(kp) = 0 $\end{document} for \begin{document}$ k\in \mathbb{Z} $\end{document} . Chen, Ostafe and Winterhof constructed the binary sequence \begin{document}$ E_{p^2} = \left(e_0, e_1, \cdots, e_{p^2-1}\right)\in \{0, 1\}^{p^2} $\end{document} as \begin{document}$ \begin{equation*} \begin{split} e_{n} = \left\{\begin{array}{ll} 0, & \hbox{if }\ 0\leq \frac{q_p(n)}{p} and studied the well-distribution measure and correlation measure of order \begin{document}$ 2 $\end{document} by using estimates for exponential sums of Fermat quotients. In this paper we further study the correlation measures of the sequence. Our results show that the correlation measure of order \begin{document}$ 3 $\end{document} is quite good, but the \begin{document}$ 4 $\end{document} -order correlation measure of the sequence is very large.
期刊介绍:
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.