Code sequences for gatewayless transmission

A systematic procedure for constructing code sequences by utilizing combinatorial difference sets is proposed. The parameters K, V, and lambda of the difference sets will determine the sequence length, the total number of symbols, and the maximum number of overlapping symbols between any two different sequences. The total number of usable sequences (S) is V(V-1) lambda /K(K-1). Special cases are discussed. Construction procedures and examples are given.<>