Computer Science – Information Theory
Scientific paper
2010-09-07
Computer Science
Information Theory
No comments
Scientific paper
Let $q$ be any prime power and let $d$ be a positive integer greater than 1. In this paper, we construct a family of $M$-ary sequences of period $q-1$ from a given $M$-ary, with $M|q-1$, Sidelikov sequence of period $q^d-1$. Under mild restrictions on $d$, we show that the maximum correlation magnitude of the family is upper bounded by $(2d -1) \sqrt { q }+1$ and the asymptotic size, as $q\rightarrow \infty$, of that is $\frac{ (M-1)q^{d-1}}{d }$. This extends the pioneering work of Yu and Gong for $d=2$ case.
No associations
LandOfFree
A family of sequences with large size and good correlation property arising from $M$-ary Sidelnikov sequences of period $q^d-1$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A family of sequences with large size and good correlation property arising from $M$-ary Sidelnikov sequences of period $q^d-1$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A family of sequences with large size and good correlation property arising from $M$-ary Sidelnikov sequences of period $q^d-1$ will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-704499