{"title":"Aperiodic/periodic complementary sequence pairs over quaternions","authors":"Zhen Li, Cuiling Fan, Wei Su, Yanfeng Qi","doi":"10.3934/amc.2021063","DOIUrl":null,"url":null,"abstract":"<p style='text-indent:20px;'>Aperodic (or called Golay)/Periodic complementary pairs (GCPs/ PCPs) are pairs of sequences whose aperiodic/periodic autocorrelation sums are zero everywhere, except at the zero shift. In this paper, we introduce GCPs/PCPs over the quaternion group <inline-formula><tex-math id=\"M1\">\\begin{document}$ Q_8 $\\end{document}</tex-math></inline-formula>, which is a generalization of quaternary GCPs/PCPs. Some basic properties of autocorrelations of <inline-formula><tex-math id=\"M2\">\\begin{document}$ Q_8 $\\end{document}</tex-math></inline-formula>-sequences are also obtained. We present three types of constructions for GCPs and PCPs over <inline-formula><tex-math id=\"M3\">\\begin{document}$ Q_8 $\\end{document}</tex-math></inline-formula>. The main ideas of these constructions are to consider pairs of a <inline-formula><tex-math id=\"M4\">\\begin{document}$ Q_8 $\\end{document}</tex-math></inline-formula>-sequence and its reverse, pairs of interleaving of sequence, or pairs of Kronecker product of sequences. By choosing suitable sequences in these constructions, we obtain new parameters for GCPs and PCPs, which have not been reported before.</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.2021063","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Aperodic (or called Golay)/Periodic complementary pairs (GCPs/ PCPs) are pairs of sequences whose aperiodic/periodic autocorrelation sums are zero everywhere, except at the zero shift. In this paper, we introduce GCPs/PCPs over the quaternion group \begin{document}$ Q_8 $\end{document}, which is a generalization of quaternary GCPs/PCPs. Some basic properties of autocorrelations of \begin{document}$ Q_8 $\end{document}-sequences are also obtained. We present three types of constructions for GCPs and PCPs over \begin{document}$ Q_8 $\end{document}. The main ideas of these constructions are to consider pairs of a \begin{document}$ Q_8 $\end{document}-sequence and its reverse, pairs of interleaving of sequence, or pairs of Kronecker product of sequences. By choosing suitable sequences in these constructions, we obtain new parameters for GCPs and PCPs, which have not been reported before.
Aperodic (or called Golay)/Periodic complementary pairs (GCPs/ PCPs) are pairs of sequences whose aperiodic/periodic autocorrelation sums are zero everywhere, except at the zero shift. In this paper, we introduce GCPs/PCPs over the quaternion group \begin{document}$ Q_8 $\end{document}, which is a generalization of quaternary GCPs/PCPs. Some basic properties of autocorrelations of \begin{document}$ Q_8 $\end{document}-sequences are also obtained. We present three types of constructions for GCPs and PCPs over \begin{document}$ Q_8 $\end{document}. The main ideas of these constructions are to consider pairs of a \begin{document}$ Q_8 $\end{document}-sequence and its reverse, pairs of interleaving of sequence, or pairs of Kronecker product of sequences. By choosing suitable sequences in these constructions, we obtain new parameters for GCPs and PCPs, which have not been reported before.
期刊介绍:
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.