Optimum binary spreading sequences of Markov chains

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