Uniquely Decodable Code-Division Via Augmented Sylvester-Hadamard Matrices

The authors consider the problem of designing binary antipodal uniquely decodable (errorless) code sets for overloaded code-division multiplexing applications where the number of signals K is larger than the code length L. Their proposed errorless code set design aims at identifying the maximum number of columns that can be potentially appended to a Sylvester-Hadamard matrix of order L, while maintaining the errorless code property. In particular, they derive formally the maximum number of columns that may be appended to the Sylvester-Hadamard matrix of order L=8 and use this result as a seed to produce an infinite sequence of designs in increasing L.

Provided by: State Street Corporation Topic: Mobility Date Added: Mar 2012 Format: PDF

Find By Topic