Optimum binary spreading sequences of Markov chains

In the presence of multipath, even if it is supposed that the received signal is the input to the correlation receiver matched to the PN code signal of some user, the multiple-access interference from the other channels still depends on even or odd autocorrelation values. This is the most significant difference between the asynchronous direct sequence code division multiple access (DS-CDMA) systems with multipath and those without multipath. Here, two-state Markov chains are considered and the optimum binary spreading sequences generated by such Markov chains are given, as far as bit error probabilities of DS-CDMA systems in multipath environments are concerned.