Combination Sequences for Spread Spectrum Communications

Certain communication systems which employ spread spectrum techniques as a means of supporting multiple users need very long codes to guard against the threat of intentional jamming, but cannot tolerate the lengthy acquisition time which long codes usually require. As a possible solution to this problem, the use of combination sequences has been suggested, and this paper presents some new results, both analytical and numerical, on this technique.

[1]  R. Gold,et al.  Optimal binary sequences for spread spectrum multiplexing (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[2]  Solomon W. Golomb,et al.  Digital communications with space applications , 1964 .

[3]  R. Titsworth Optimal Ranging Codes , 1964, IEEE Transactions on Space Electronics and Telemetry.

[4]  Laurence B. Milstein Some statistical properties of combination sequences (Corresp.) , 1977, IEEE Trans. Inf. Theory.