|
[1]P. Chaudhury, W. Mohr, S. Onoe, “The 3GPP Proposal for IMT-2000,” IEEE Commun. Magazine, Vol. 37 no. 12, pp. 72-81, Dec. 1999.[2]D. V. Sarwate and M. B. Pursley, “Crosscorrelation properties of Pseudorandom and Related Sequences,” IEEE proc., vol. 68, no. 5, pp.593-619, May 1980.[3]R. A. Scholtz, “The origins of spread-spectrum communications,” IEEE Trans. Commun., COM-30, pp. 822-854, May 1982.[4]M. P. Ristenbatt and J. L. Daws, Jr., “Performance criteria for spread spectrum communications,” IEEE Trans. Commun., COM-25, (8), pp. 756-763, Aug. 1977.[5]M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communicatioins, vol. I. Rockville, MD: Computer Science Press, 1985.[6]R. Gold, “Optimal binary sequences for spread spectrum multiplexing,” IEEE trans. Inform. Theory, IT-13, (5), pp. 619-621, Oct. 1967.[7]R. Gold, “Maximal recursive sequences with 3-valued recursive crosscorrelation functions,” IEEE Trans. Inform. Theory, Vol. IT-14, pp. 154-156, Jan 1968.[8]T. Kasami, “Weight distribution formula for some class of cyclic codes,” Coordinated Science Laboratory, University of Illinois, Urbana, Tech. Rep. R-285 (AD632574), 1966.[9]J. S. No and P. V. Kumar, “A new family of binary pseudorandom sequences having optimal periodic correlation properties and large span,” IEEE Trans., IT-35, No. 2, pp.371-379, 1989.[10]J. D. Olsen, R. A. Scholtz and L. R. Welch, “Bent-Function sequences.” IEEE Trans. Inform. Theory, vol. IT-28, pp. 858-864, Nov. 1982.[11]E. H. Dinan and B. Jabbari, “Spreading Codes for Direct Sequence CDMA and Wideband CDMA Cellular Networks,” IEEE Communications Magazine, pp. 48-54, Sep., 1998.[12]D . V. Sarwarte and M. B. Pursley, “Crosscorrelation properties of pseudorandom and related sequences,” Proc. IEEE, vol. 68, no. 5, pp.593-620, may 1980.[13]Mo-Han Fong, Vijay K. Bhargava, “Efficient Integration of Multi-rate Traffic for 3RD Generation DS-CDMA Systems”, IEEE Int. conf. Commun. 1999, 3, pp. 1426-1430[14]R. L. Peterson, R. E. Ziemer, D. E. Borth, “Introduction to Spread Spectrum Communications,” Prentice Hall, Inc., 1995.[15]C. Y. Lai and C. K. Lo, “Nonlinear Orthogonal Spreading Sequence Design for 3rd Generator DS-CDMA Systems,” IEE Proceeding-Communications, Accepted, Nov. 2001[16]R. A. Scholtz and L. R. Welch, “GMW Sequences”, IEEE Trans. On Information Theory, IT-30, pp. 548-553,1984.[17]K. Yang, Y. —K. Kim, and P. V. Kumar, “Quasi-Orthogonal Sequences for Code-Division Multiple-Access Systems,” IEEE Trans. Information Theory, vol. 46, no. 3, pp 982-993, May 2000.[18]F. Jessie MacWilliams, Neil J. A. Sloane, “Pseudo-Random Sequences and Arrays,” Proceedings of the IEEE, Vol. 64, No. 12, December 1976.[19]洪裕欽, “長度63及255之最大長度序列及GMW序列之密碼分析,” 碩士論文, 1999年6月.[20]J. MacWilliams and N. Sloane, The Theory of Error- Correcting Codes. New York: North-Holland Publishing Company, 1978.[21]M. Harwit and N. J. A Sloane, Hadamard Transform Optics, New York: Academic, 1979.[22]S. W. Golomb, Shift Register Sequences, Laguna Hills, CA: Aegean Park Press, 1982.[23]W. H. Mills, “Continued Fractions and Linear Recurrences,” Math of Computation, vol. 29, no. 129, pp.173-180, Jan. 1975.[24]L. R. Welch, and R. A. Scholtz, “Continual Fractions and Berlekamp’s Algorithm,” IEEE Trans. On Inform. Theory, vol. IT-25, no.1, pp.19-27, 1979.[25]T. W. Cusik and H. Dobbertin, “Some new three-valued crosscorrelation functions for binary m-sequences,” IEEE Trans. Inform. Theory, vol. 42, no. 4, pp. 1238-1240, July 1996[26]P. Fan and M. Darnell, Sequence Design for Communication Applications, U. K. : Research Studies Press, 1996.[27]J. K. Holmes, Coherent Spread Spectrum Systems, New York : Wiley-Interscrence, 1982.[28]J. G. Proakis, “Communication Systems Engineering”, Prentice Hall.[29]R. J. McEliece, Finite Fields for Computer Scientists and Engineers. Boston, MA: Kluwer, 1987.[30]A. Lempel and M. Cohn, “Maximal families of bent sequences,” IEEE Trans. Inform. Theory, vol. IT-28, pp.865-868, Nov. 1982.[31]R. Yarlagadda and J. E. Hershey, “Analysis ans synthesis of bent sequences,” IEE Proc. (Part E), vol. 136, Mar. 1989, pp.112-123[32]J. —S. No, K. Yang, H. Chung, and H. —Y. Song, “Extension of binary sequences with ideal autocorrelation property,” inProc 1996 IEEE Int. Symp. On Information Theory and Its Applications(ISITA’ 96)(Victoria, BC, Canada, Sept. 17-20, 1996), pp.837-840.[33]J. —S. No, K. Yang, H. Chung, and H. —Y. Song, “New construction for families of binary sequences with optimal correlation properties,” IEEE Trans. Inform. Theory, vol. 43, pp.1596 —1602, Sept. 1997.[34]L. D. Baumert, Cyclic Difference Set(Lecture Notes in Mathematics). Berlin, Germany: Springer-Verlag, 1971[35]D. Jungnickel, “Difference sets, “inContemporary Design Theory, J. H. Dinitz and D. R. Stinson, Eds. New York: Wiley, 1992, pp.241-324[36]J. —S. No, H. -K. Lee, H. Chung, and H. —Y. Song, and K. Yang, “Trace representation of Legender sequences of Mersenne prime period,” IEEE Trans. Inform. Theory, vol. 42, pp.2254-2255, Nov. 1996.[37]H. Y. Song and S. W. Golomb, “On the existence of cyclic Hadamard difference sets,” IEEE Trans. Inform. Theory, IT-40 (4), pp. 1266-1268, July 1998.[38]J. —S. No, S. W. Golomb, G. Gong, H.-K. Lee, and P. Gaal, “Binary pseudorandom sequences of period 2n-1 with ideal autocorrelation”, IEEE Trans. Inform. Theory, IT-44 (2), pp. 814-817, March 1998.[39]E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
|