Sets of Low Correlation Sequences from Cyclotomy
Jonathan M. Castello, Daniel J. Katz, Jacob M. King, and Alain, Olavarrieta

TL;DR
This paper constructs families of low correlation sequences using cyclotomy, achieving near-optimal demerit factors and low maximum correlations, with applications in communications and remote sensing.
Contribution
It introduces a novel cyclotomy-based method to generate low correlation sequence codebooks with asymptotically optimal properties, extending to nonbinary sequences.
Findings
Demerit factor approaches 1 as sequence length increases.
Maximum correlation magnitude is bounded by a small constant times √p log p.
Construction applies to sequences of length p where p is prime with specific divisibility conditions.
Abstract
Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences has low aperiodic crosscorrelation at all shifts. An overall criterion of codebook quality is the demerit factor, which normalizes all sequences to unit Euclidean norm, sums the squared magnitudes of all the correlations between every pair of sequences in the codebook (including sequences with themselves to cover autocorrelations), and divides by the square of the number of sequences in the codebook. This demerit factor is expected to be for a codebook of randomly selected binary sequences of length , but we want demerit factors much closer to the absolute minimum value of . For each such that there is an …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Wireless Communication Networks Research
