A system and method of construction of unique word sets together with an efficient method of implementing correlation with the members of the set is presented. The set of UWs is constructed by breaking a UW sequence in to equal length segments, and then multiplying this vector by an orthogonal matrix. First an arbitrary vector U is chosen of length K for a set of N UWs. Then a matrix H of size N×N is chosen. The columns of H are then repeated L times to form a matrix H′. The set of N UW consists of the rows of H′UT. N sub-correlations of the N segments of the vector U with the segments of the (suitably delayed) received signal is performed at the receiver. Then the N different outputs are obtained as Z=HCT, where C=[C0 . . . CN-1] is the vector of correlated outputs. The receiver only requires N correlators, each of length L, instead of length K, which provides a less complex and more efficient solution for detection of UW sets.