Constructions of q-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths
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 \A,B\ consists of two q-ary complex sequences A=(A0,·s,AM-1) and B=(B0,·s,BM-1) of equal length M, where Ai,Bi∈\a:0≤ a≤ q-1\ with =e2π-1q.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 2mM for all integers h,m≥1. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.