Almost p-ary Sequences
B\"u\c{s}ra \"Ozden, O\u{g}uz Yayla

TL;DR
This paper investigates the autocorrelation properties of almost p-ary sequences, establishing bounds on autocorrelation coefficients, proving non-existence of certain nearly perfect sequences, and linking sequence existence to a new combinatorial structure called PDPDS.
Contribution
It introduces bounds on autocorrelation coefficients, defines a new difference set (PDPDS), and establishes conditions for the existence of almost p-ary nearly perfect sequences.
Findings
Autocorrelation coefficient bounds for almost p-ary sequences.
Non-existence of nearly perfect sequences with two consecutive zero symbols.
Connection between sequences and PDPDS structures.
Abstract
In this paper we study almost -ary sequences and their autocorrelation coefficients. We first study the number of distinct out-of-phase autocorrelation coefficients for an almost -ary sequence of period with consecutive zero-symbols. We prove an upper bound and a lower bound on . It is shown that can not be less than . In particular, it is shown that a nearly perfect sequence with at least two consecutive zero symbols does not exist. Next we define a new difference set, partial direct product difference set (PDPDS), and we prove the connection between an almost -ary nearly perfect sequence of type and period with two consecutive zero-symbols and a cyclic PDPDS for arbitrary…
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.
