Title :
On McEliece´s open problem on minimax aperiodic correlation
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong
fDate :
27 Jun-1 Jul 1994
Abstract :
It is well-known that estimates and bounds on some useful performance measures for direct sequence spread-spectrum multiple-access (DS/SSMA) systems, such as the worst-case probability of detection errors and the average signal-to-noise ratio, can be expressed in terms of the maximum aperiodic correlation Cs(max) of the set S of signature sequences. Cs(max) is the maximum magnitude of the aperiodic correlation between any two, not necessarily distinct, sequences in the set S at any time shift, excluding the trivial case of in-phase autocorrelation of a single sequence. For given integers X and L, the author defines the minimax aperiodic correlation Cmm and examines the upper bound result of McEliece (1980) for certain sets of binary sequences derived from irreducible cyclic codes
Keywords :
binary sequences; correlation methods; cyclic codes; minimax techniques; multi-access systems; spread spectrum communication; DS/SSMA; McEliece´s open problem; average signal-to-noise ratio; binary sequences; detection errors probability; direct sequence spread-spectrum multiple-access; irreducible cyclic codes; minimax aperiodic correlation; performance measures; signature sequences; time shift; Autocorrelation; Binary sequences; Minimax techniques; Signal to noise ratio; Spread spectrum communication; Telecommunication control; Upper bound;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394895