DocumentCode :
1161597
Title :
Complex sequences over GF(pM) with a two-level autocorrelation function and a large linear span
Author :
Antweiler, Markus ; Bömer, Leopold
Author_Institution :
Inst. fuer Elektrische Nachrichtentechnik, Rhein.-Westf. Tech. Hochschule, Aachen, Germany
Volume :
38
Issue :
1
fYear :
1992
fDate :
1/1/1992 12:00:00 AM
Firstpage :
120
Lastpage :
130
Abstract :
New complex sequences with elements are proposed that have constant absolute values of 1. The periodic autocorrelation functions of these sequences are shown to be two-level. The sequences are generated by three consecutive mapping processes. The number of sequences of fixed length is determined, which is larger than the number of binary sequences. For cryptographical reasons, the large linear span of the sequences is of great interest. The linear span of the new sequences is examined and is proven to be larger than the linear span of complex m-sequences, if the parameters of the mapping processes are appropriately chosen. The formula for generating the sequences is generalized to enlarge the linear span of sequences
Keywords :
correlation theory; cryptography; information theory; GF(pM); complex sequences; cryptography; large linear span; mapping processes; two-level autocorrelation function; Autocorrelation; Binary sequences; Cryptography; Electronic switching systems; Equations; Galois fields; Linear feedback shift registers; Milling machines; Radar applications; System identification;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.108256
Filename :
108256
Link To Document :
بازگشت