location: Current position: Home >> Scientific Research >> Paper Publications

Binary almost-perfect sequence sets

Hits:

Indexed by:期刊论文

Date of Publication:2010-07-01

Journal:IEEE Transactions on Information Theory

Included Journals:EI

Volume:56

Issue:7

Page Number:3594-3604

ISSN No.:00189448

Abstract:Sequence set with lower correlation values is highly desired for engineering applications. However, theoretical results (e.g., Welch bound) show that θ max  ?N in general, that is, the maximum out-of-phase autocorrelation and cross-correlation magnitudes of a sequence set is not less than the square root of the sequence period. In this paper, we propose a new concept, namely almost perfect sequence set (APSS), which has the property θmax ≤c except for at most m shifts, where c and m are predefined small integers. A uniform method is presented to construct APSS and then the properties of such APSS are discussed. Moreover, a distance inequality on the APSS with m = 1 is obtained and several APSS families such as (2p, 8p+2, 6, 4)-APSS and (3p, 64p2+8\over 3, 9, 9\right)-APSS for any prime  ?5 are constructed based on Paley and Paley partial sequences. Finally, it shows that the APSS can be used to construct LCZ sequences and the properties of such LCZ sequences are presented. © 2006 IEEE.

Pre One:Further results on planar DO functions and commutative semifields

Next One:A note on permutation polynomials over Z(n)