Multiuser coding based on detecting matrices for synchronous-CDMA systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1355, Issue , 1997, Pages 251-257

  Mow, Wai Ho ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

ADDER CHANNELS; CONVENTIONAL SYSTEMS; INTER-USER INTERFERENCE; MULTI-USER; RECURSIVE CONSTRUCTION; SPREADING SEQUENCES; SYNCHRONOUS CDMA SYSTEMS; SYSTEM CAPACITY;

CODE DIVISION MULTIPLE ACCESS;

EID: 45249113746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024470     Document Type: Conference Paper

References (8)

1. G. H. Khachatrian and S. S. Martirossian, "A New Approach to the Design of Codes for Synchronous-CDMA Systems," IEEE Trans. Inform. Theory, vol. IT-41, pp. 1503-1506, 1995.
2. Y. W. Wu and S. C. Chang, "Coding Scheme for Synchronous-CDMA Systems," IEEE Trans. Inform. Theory, vol. IT-43, pp. 1064-1067, 1997.
3. S.-C. Chang and E. J. Weldon, Jr., "Coding for T-User Multiple-Access Channels," IEEE Trans. Inform. Theory, vol. IT-25, pp. 684-691, 1979.
4. S. Söderberg and H. S. Shapiro, "A combinatory detection problem," Amer. Math. Monthly, vol. 70, pp. 1066-1070, 1963.
5. D. G. Cantor and W. H. Mills, "Determining a Subset from Certain Combinatorial Properties," Canad. J. Math, vol. 18, pp. 42-48, 1966.
6. B. Lindström, "On a combinatory detection problem," Publ. Hung. Acad. Sci., vol. 9, pp. 195-207, 1964.
7. T. J. Ferguson, "Generalized T-User Codes for Multiple-Access Channels," IEEE Trans. Inform. Theory, vol. IT-28, pp. 775-778, 1982.
8. S.-C. Chang, "Further Results on Coding for T-User Multiple-Access Channels," IEEE Trans. Inform. Theory, vol. IT-30, pp. 411-415, 1984.