A new set of polyphase sequences with low correlation and low ambiguity function

Sequences with low correlation and low ambiguity function magnitude play a pivotal role in both wireless communication and radar systems. In this paper, we propose a new set of polyphase sequences over Galois rings. Precisely derive the size of the sequence set, its correlation, and the ambiguity function magnitude. The proposed generalized sequences have period $ N = p^n-1 $, family size $ M\geq\frac{p^{nm}(p^{ne}-1)}{p^n-1} $, the maximum correlation magnitude $ \theta_{\text{max}} \leq \max\left\{p^{e-1}-1, p^{j-1}(1+p^m)-1\right\}\sqrt{p^n}+1 $, and the maximum ambiguity magnitude $ \widehat{\theta}_{\text{max}} \leq \max\left\{p^{e-1}, p^{j-1}(1+p^m)\right\}\sqrt{p^n} $, where $ p $ is any prime, $ n $ and $ e $ are positive integers, $ e<\frac{n+2}{2} $, $ 1\leq j \leq e-1 $ and $ 0\leq m <\frac{n+2}{2}-j $.

Authors

Institutions

Publication Details

Journal
Advances in Mathematics of Communications
Published
2025-01-01
DOI
https://doi.org/10.3934/amc.2025020
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new set of polyphase sequences with low correlation and low ambiguity function

Zhengchun Zhou, Furong Bao, Shixin Zhu, Xia Wu
Advances in Mathematics of Communications
Coding theory and cryptography
article

A new set of polyphase sequences with low correlation and low ambiguity function

Zhengchun Zhou, Furong Bao, Shixin Zhu, Xia Wu
article en

Abstract

Sequences with low correlation and low ambiguity function magnitude play a pivotal role in both wireless communication and radar systems. In this paper, we propose a new set of polyphase sequences over Galois rings. Precisely derive the size of the sequence set, its correlation, and the ambiguity function magnitude. The proposed generalized sequences have period $ N = p^n-1 $, family size $ M\geq\frac{p^{nm}(p^{ne}-1)}{p^n-1} $, the maximum correlation magnitude $ \theta_{\text{max}} \leq \max\left\{p^{e-1}-1, p^{j-1}(1+p^m)-1\right\}\sqrt{p^n}+1 $, and the maximum ambiguity magnitude $ \widehat{\theta}_{\text{max}} \leq \max\left\{p^{e-1}, p^{j-1}(1+p^m)\right\}\sqrt{p^n} $, where $ p $ is any prime, $ n $ and $ e $ are positive integers, $ e<\frac{n+2}{2} $, $ 1\leq j \leq e-1 $ and $ 0\leq m <\frac{n+2}{2}-j $.

Advances in Mathematics of CommunicationsVol. 19(6)
Hefei University of Technology (CN), Southwest Jiaotong University (CN), Southeast University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Sichuan Province
Zero hunger
Openalex Percentile: Top 93%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.