kth order near-orthogonal codes
I.S. Reed · IEEE Transactions on Information Theory · 1971
Abstract : Certain near-orthogonal codes have recently been used in multiple- short keying communication systems. The codes generally considered for this application are the first order Reed-Solomon (RS) codes. The purpose of this paper is to extend this class of codes. It is shown that codes can be developed with the property that no two members of the code overlap in more than k frequency-time slots. It is also shown that certain subsets of these codes are synchronizable. The optimum kth order near-orthogonal synchronizable codes are certain subsets of RS codes with a maximum distance d = n-k, where n is the number of code symbols.