A Class of Codes for a T Active Users Out of N Multiple-Access Communication System

IEEE Transactions on Information Theory

Volumn 36, Issue 6, 1990, Pages 1206-1219

  Mathys, Peter ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS;

COLLISION RESOLUTION; DECODING ALGORITHM; MULTIACCESS COMMUNICATION SYSTEMS;

CODES, SYMBOLIC;

EID: 0025517239     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.59923     Document Type: Article

References (44)

1. R. Ahlswcdc, Multi-way communication channels,” in Proc. 2nd Int. Symp. Inform. Theory, Tsahkadsor, Armenian S.S.R., 1971, Hungarian Acad. Sc., 23–52, 1973.
2. I. Bar-David, E. Plotnik, and R. Rom, “The capacity of the synchronized random multiple-access channel is at least 1, achievable by forward collision resolution.” 1987 IEEE Inform Theory Workshop, Bellagio, Italy, June 21–25, 1987.
3. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill. 1968, revised edition, New York: Aegean Park Press, 1984.
4. S. C. Chang and E. J. Weldon, Jr., “Coding for T-user multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-25, no. 6, 684 691, Nov. 1979.
5. S. C. Chang and J. K. Wolf, “On the T-user M -frequency noiseless multiple-access channel with and without intensity information,” IEEE Trans. Inform. Theory, vol. IT-27, no. 1, pp. 41–48, Jan. 1981.
6. S. C. Chang, “Further results on coding for T-user multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-30, no. 2, pp. 411–415, Mar. 1984.
7. P. A. B. M. Coebergh van den Braak and H. C. A. van Tilborg, “A family of good uniquely decodable code pairs for the two-access binary adder channel,” IEEE Trans. Inform. Theory, vol. IT-31, no. 1, pp. 3–9, Jan. 1985.
8. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Grundlehren der mathematischen Wissenschaften 290. New York; Springer-Verlag, 1988.
9. I. Csiszar and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
10. A. El Gamal and T. M. Cover, “Multiple user information theory,” Proc. of the IEEE, vol. 68, no. 12, pp. 1466–1483, Dec. 1980.
11. D. F. Elliot and K. R. Rao, Fast Transforms: Algorithms, Analyses, Applications. New York: Academic Press, 1982.
12. T. Ericson and L. Gyorfi, “Superimposed codes in R n,” IEEE Trans. Inform. Theory, vol. IT-34, no. 4, pp. 877–880, July 1988.
13. P. G. Farrell, “Survey of channel coding for multi-user systems,” in New Concepts in Multi-User Communication, J. K. Skwirzynski, Ed. Alphen aan den Rijn, The Netherlands: Sijthoff and Noordhoff, pp. 133–159, 1981
14. T. J. Ferguson, “Generalized T-user codes for multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-28, no. 5, pp. 775–778, Sept. 1982.
15. R. G. Gallager, “A perspective on multiaccess channels,” IEEE Trans. Inform. Theory, vol. IT-31, no. 2, pp. 124–142, Mar. 1985.
16. T. Kasami, S. Lin, and S. Yamamura, “Further results on coding for a multiple-access channel,” in Topics in Information Theory, I. Csiszar and P. Elias, Eds. New York: North-Holland Publishing Company, pp. 369–392, 1975.
17. T. Kasami and S. Lin, “Coding for a multiple-access channel,” IEEE Trans. Inform. Theory, vol. IT-22, no. 2, pp. 129–137, Mar. 1976.
18. T. Kasami, S. Lin, V. K. Wei, and S. Yamamura, “Graph theoretic approaches to the code construction for the two-user multiple-access binary adder channel,” IEEE Trans. Inform. Theory, vol. IT-29, no. 1, pp. 114-130. Jan. 1983.
19. G. H. Khachatrian [G. G. Khachatryan], “On the construction of codes for noiseless synchronized 2-user channels,” Prob. Contr. Inform. Theory, vol. 11, pp. 319–324, 1982.
20. G. G. Khachatryan, “Decoding for a noiseless adder channel with two users,” Probl. Peredach. Inform., vol. 19, no. 2, pp. 8–13 (pp. 91–96 in English translation), Apr.-June 1983.
21. G. G. Khachatryan, “δ-decodable code constructions for a T-user adder channel,” Probl. Peredach. Inform., vol. 24, no. 2, pp. 94–99 (pp. 159–163 in English translation), Apr.-June 1988.
22. G. H. Khachatrian, “New code constructions for binary switching two-user channel,” in Proc. 4th Joint Swedish-Soviet Int. Workshop Inform. Theory, Gotland, Sweden, Aug. 27-Sept. 1, 1989. pp. 122–126.
23. H. Liao, “A coding theorem for multiple access communications,” in Proc. Int. Symp. Inform. Theory, Asilomar, CA, 1972; also “Multiple access channels,” Ph.D. dissertation, Dept. Elect. Eng., Univ. of Hawaii, 1972.
24. S. Lin and V. K. Wei, “Nonhomogeneous trellis codes for the quasi-synchronous multiple-access binary adder channel with two users,” IEEE Trans. Inform. Theory, vol. IT-32, no. 6, pp. 787–796, Nov. 1986.
25. R. Lupas and S. Verdu, “Linear multiuser detectors for synchronous code-division multiple-access channels,” IEEE Trans. Inform. Theory, vol. 35, no. 1, pp. 123–136, Jan. 1989.
26. J. L. Massey, guest editor, “Special issue on random-access communications,” IEEE Trans. Inform. Theory, vol. IT-31, no. 2, pp. 117–310, Mar. 1985.
27. J. L. Massey and P. Mathys, “The collision channel without feedback,” IEEE Trans. Inform. Theory, vol, IT-31, no. 2, pp. 192–204, Mar. 1985.
28. P. Mathys, “Multiple-access coding with error control: A code construction for the real adder channel,” in Proc. 4th Joint Swedish-Soviet Int. Workshop Inform. Theory, Gotland, Sweden, Aug. 27-Sept. 1, 1989, pp. 175–179.
29. N. Mehravari, “Random-access communication with multiple reception,” 1988 Int. Symp. Inform. Theory, Kobe, Japan, June 20–24, 1988.
30. E. C. van der Meulen, “A survey of multi-way channels in information theory; 1961-1976,” invited paper, IEEE Trans. Inform. Theory, vol. IT-23, no. 1, pp. 1–37, Jan. 1977.
31. Yu. G. Rechetnyak, “New proof of a theorem of N. G. Tchebotarev,” Uspehi Matematitcheskih Nauk, vol. 10, no. 3 (65), pp. 155–157, 1955, in Russian.
32. D. Shanks, Solved and Unsolved Problems in Number Theory, 3rd Ed. New York: Chelsea Publishing Company, 1985
33. C. E. Shannon, “Two-way communication channels,” in Proc. 4th Berkeley Symp. Math. Statist, and Prob., vol. 1, 1961, pp. 611–644. Reprinted in “Key papers in the development of information theory,” D. Slepian, Ed., IEEE Press, 1974, pp. 339–372.
34. N. G. Tchebotarcv, “Mathematical autobiography,” Uspehi Matematitcheskih Nauk, vol. 3, no. 4 (26), 1948, pp. 3–66, in Russian.
35. B. S. Tsybakov, V. A. Mikhailov, and N. B. Likhanov, “Bounds for packet transmission rate in a random-multiple-access system,” Probl. Peredach. Inform., vol. 19, no. 1, pp. 61–81 (pp. 50–68 in English translation), Jan.-Mar. 1983.
36. B. S. Tsybakov and N. B. Likhanov, “Packet switching in a channel without feedback,” Probl. Peredach. Inform., vol. 19, no. 2, pp. 69–84 (pp. 147–161 in English translation), Apr.-June 1983.
37. P. Vanroose and E. C. van der Meulen, “On the construction of block codes for the two-user binary switching multiple-access channel,” Proc. 3rd Joint Swedish-Soviet Int. Workshop Inform. Theory, Sochi, USSR, May 24–30, 1987, pp. 327–330.
38. P. Vanroose, “Code construction for the noiseless binary switching multiple-access channel,” IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 1100-1106, Sept. 1988.
39. S. Verdu, “Minimum probability of error for asynchronous Gaussian multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-32, no. 1, pp. 85–96, Jan. 1986.
40. E. J. Weldon, Jr., “Coding for a multiple-access channel,” Inform. Contr., vol. 36, no. 3, pp. 256–274, Mar. 1978.
41. J. H. Wilson, “Error-correcting codes for a T-user binary adder channel,” IEEE Trans. Inform. Theory, vol. 34, no. 4, pp. 888–890, July 1988.
42. J. K. Wolf, “Multi-user communication networks,” in Communication Systems and Random Pmcess Theory, J. K. Skwirzynski, Ed. Alphen aan den Rijn, The Netherlands: Sitjhoff and Noordhoff, 1978, pp. 37-53.
43. J. K. Wol, “Coding techniques for multiple access communication channels,” in New Concepts in Multi-User Communication, J. K. Skwitzynski, Ed. Alphen aan den Rijn, The Netherlands: Sitjhoff and Noordhoff, 1981, pp. 83-103.
44. J. K. Wol, “Panel discussion on multi-user information theory,” in New Concepts in Multi-User Communication, J. K. Skwirzynski, Ed. Alphen aan den Rijn, The Netherlands: Sijthoff and Noordhoff, 1981. pp. 105-130.