Constructions of $q$-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths

April 16, 2026 Β· Grace Period Β· + Add venue

⏳ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Zhiye Yang, Keqin Feng arXiv ID 2604.14667 Category cs.IT: Information Theory Citations 0
Abstract
Golay complementary pair (GCP), first introduced by Golay in 1951, has been extensively studied and widely applied in communication systems. A $q$-ary GCP $\{\mathbf{A},\mathbf{B}\}$ consists of two $q$-ary complex sequences $\mathbf{A}=(A_0,\cdots,A_{M-1})$ and $\mathbf{B}=({B}_0,\cdots,{B}_{M-1})$ of equal length $M$, where $\textit{A}_i,\textit{B}_i\in\{ΞΎ^a:0\leq a\leq q-1\}$ with $ΞΎ=e^{\frac{2Ο€\sqrt{-1}}{q}}$.In this paper,we prove that the existence of a quaternary ($q=4$) GCP of length $M$ is equivalent to the explicit constructibility of ($4h$)-ary GCPs of length $2^mM$ for all integers $h,m\geq1$. All proposed sequences are constructed via extended Boolean functions (EBFs), and the direct construction yields GCPs with more flexible length ranges than all previous relevant results.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory