New classes of sequence families with low correlation by using multiplicative and additive characters
文件大小:
88k
资源说明:For an odd prime p, a new sequence family of period pm – 1, size (M – 1)pmr is proposed using multiplicative and additive characters. The upper bound for the maximum magnitude of nontrivial correlations of the sequence family is derived using well-known character sums. The upper bound is shown to be (r+1)\sqrt (p^m)+3, which meets the Welch bound asymptotically
本源码包内暂不包含可直接显示的源代码文件,请下载源码包。