Kasami sequences have good cross-correlation values approaching the Welch lower bound.
The process of generating a Kasami sequence is initiated by generating a maximum length sequence a(n), where n = 1…2N−1.
Modified sequences are then formed by adding a(n) and cyclically time shifted versions of b(n) using modulo-two arithmetic, which is also termed the exclusive or (xor) operation.
Computing modified sequences from all 2N/2 unique time shifts of b(n) forms the Kasami set of code sequences.
This article related to telecommunications is a stub.