Reference32 articles.
1. S. Bross and I. F. Blake, “Upper bound for uniquely decodable codes in a binary input N-user adder channel,” International Symposium on Information TheorySan Antonio, Texas, January, 1993.
2. S.-C. Chang and E.J. Weldon, Jr., “ Coding for T-user multiple-access channels,” IEEE
Trans. Inf. Theory,vol. IT-25, 684–691, 1979.
3. S.-C. Chang and J.K. Wolf, “On the T-user M-frequency noiseless multiple-access channel with and without intensity information”, IEEE Trans. Inf. Theory, vol.IT-27, 41–48, 1981.
4. S.-C. Chang, “Further results on coding for the T-user multiple-access channels,” IEEE
Trans. Inf. Theory, vol. IT-30, 411–415, 1984.
5. P. Chevillat, “ N-User trellis coding for a class of multiple-access channels” IEEE
Trans. Inf. Theory
vol. IT-27, 114–120, 1981.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献