DocumentCode :
1490836
Title :
New construction for binary sequences of period pm-1 with optimal autocorrelation using (z+1)d+azd+b
Author :
No, Jong-Seon ; Chung, Habong ; Song, Hong-Yeop ; Yang, Kyeongcheol ; Lee, Jung-Do ; Helleseth, Tor
Author_Institution :
Dept. of Electr. Eng., Seoul Nat. Univ., South Korea
Volume :
47
Issue :
4
fYear :
2001
fDate :
5/1/2001 12:00:00 AM
Firstpage :
1638
Lastpage :
1644
Abstract :
We present a construction for binary sequences {s(t)} of period N=pm-1 for an odd prime p based on the polynomial (z+1)d +azd+b, and discuss them in some cases of parameters p, m, d, a, and b. We show that new sequences from our construction are balanced or almost balanced and have optimal three-level autocorrelation for the case when the polynomial (z+1)d+zd+a can be transformed into the form z2-c. We also derive the distribution of autocorrelation values they take on. The sequences satisfy constant-on-the-coset property, and we show that there are more than one characteristic phases with constant-on-the-coset property. Some other interesting properties of those sequences are presented. For the cases when the polynomial (z+1)d+zd+a cannot be transformed into the form z2-c, we performed extensive computer search, and results are summarized. Based on these results, some open problems are formulated
Keywords :
binary sequences; correlation methods; optimisation; polynomials; search problems; autocorrelation values distribution; binary sequences construction; computer search; constant-on-the-coset property; optimal autocorrelation; optimal three-level autocorrelation; polynomial; Autocorrelation; Binary sequences; Block codes; CD recording; Communication system control; Decoding; Information theory; Observability; Polynomials;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.923752
Filename :
923752
Link To Document :
بازگشت