-
1
-
-
0002195239
-
Multi-way communication channels
-
(Tsahkadsor, Armenia, USSR), Sept.
-
R. Ahlswede, “Multi-way communication channels,” in Proc. 2nd Int. Symp. on Information Theory (Tsahkadsor, Armenia, USSR), Sept. 1971, pp. 23–52.
-
(1971)
Proc. 2nd Int. Symp. on Information Theory
, pp. 23-52
-
-
Ahlswede, R.1
-
2
-
-
19544392969
-
A coding theorem for multiple access communications
-
presented at the Int. Symp. on Inform. Theory, Asilomar, CA
-
H. Liao, “A coding theorem for multiple access communications,” presented at the Int. Symp. on Inform. Theory, Asilomar, CA, 1972.
-
(1972)
-
-
Liao, H.1
-
3
-
-
0003090330
-
Coding in an asynchronous multiple-access channel
-
July/Sept.
-
G. Poltyrev, “Coding in an asynchronous multiple-access channel,” Probl. Peredachi Inform., vol. 19, pp. 12–21, July/Sept. 1983.
-
(1983)
Probl. Peredachi Inform.
, vol.19
, pp. 12-21
-
-
Poltyrev, G.1
-
4
-
-
0022031156
-
The capacity region of totally asynchronous multiple-access channels
-
Mar.
-
J. Hui and P. Humblet, “The capacity region of totally asynchronous multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-31, no. 2, pp. 207–216, Mar. 1985.
-
(1985)
IEEE Trans. Inform. Theory
, vol.IT-31
, Issue.2
, pp. 207-216
-
-
Hui, J.1
Humblet, P.2
-
5
-
-
0024668728
-
Multiple-access channels with memory with and without frame synchronism
-
May
-
S. Verdú, “Multiple-access channels with memory with and without frame synchronism,” IEEE Trans. Inform. Theory, vol. 35, no. 3, pp. 605–619, May 1989.
-
(1989)
IEEE Trans. Inform. Theory
, vol.35
, Issue.3
, pp. 605-619
-
-
Verdú, S.1
-
6
-
-
0002031137
-
Capacity region of Gaussian CDMA channels: The symbol-synchronous case
-
(Allerton, IL, Oct.)
-
—, “Capacity region of Gaussian CDMA channels: The symbol-synchronous case,” in Proc. 24th Allerton Conf. on Communications, Control and Computing (Allerton, IL, Oct. 1986), pp. 1025–1034.
-
(1986)
Proc. 24th Allerton Conf. on Communications, Control and Computing
, pp. 1025-1034
-
-
Verdú, S.1
-
7
-
-
0024705423
-
Capacity region of the symbol-asynchronous Gaussian multiple-access channel
-
July
-
—, “Capacity region of the symbol-asynchronous Gaussian multiple-access channel,” IEEE Trans. Inform. Theory, vol. 35, no. 4, pp. 735–751, July 1989.
-
(1989)
IEEE Trans. Inform. Theory
, vol.35
, Issue.4
, pp. 735-751
-
-
Verdú, S.1
-
8
-
-
0026154202
-
Capacity of root mean square bandlimited Gaussian multiuser channel
-
May
-
R. S. Cheng and S. Verdú, “Capacity of root mean square bandlimited Gaussian multiuser channel,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pp. 453–465, May 1991.
-
(1991)
IEEE Trans. Inform. Theory
, vol.37
, Issue.3
, pp. 453-465
-
-
Cheng, R.S.1
Verdú, S.2
-
9
-
-
84939016980
-
Total capacity of RMS bandlimited K-user RAM synchronous channel
-
(Allerton, IL, Sept.)
-
—, “Total capacity of RMS bandlimited K-user RAM synchronous channel,” in Proc. 27th Allerton Conf. on Communications, Control and Computing (Allerton, IL, Sept. 1989), pp. 1112–1121.
-
(1989)
Proc. 27th Allerton Conf. on Communications, Control and Computing
, pp. 1112-1121
-
-
Cheng, R.S.1
Verdú, S.2
-
10
-
-
0026705998
-
The effect of asynchronism on total capacity of Gaussian multiple-access channels
-
Jan.
-
—, “The effect of asynchronism on total capacity of Gaussian multiple-access channels,” IEEE Trans. Inform. Theory, vol. 38, no. 1, pp. 2–13, Jan. 1992.
-
(1992)
IEEE Trans. Inform. Theory
, vol.38
, Issue.1
, pp. 2-13
-
-
Cheng, R.S.1
Verdú, S.2
-
11
-
-
0028461974
-
Optimum sequence multisets for symbolsynchronous code-division multiple-access channels
-
July
-
M. Rupf and J. L. Massey, “Optimum sequence multisets for symbolsynchronous code-division multiple-access channels,” IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 1261–1266, July 1994.
-
(1994)
IEEE Trans. Inform. Theory
, vol.40
, Issue.4
, pp. 1261-1266
-
-
Rupf, M.1
Massey, J.L.2
-
12
-
-
0022034656
-
A perspective on multiaccess channels
-
Mar.
-
R. Gallager, “A perspective on multiaccess channels,” IEEE Trans. Inform. Theory, vol. IT-31, no. 2, pp. 124–142, Mar. 1985.
-
(1985)
IEEE Trans. Inform. Theory
, vol.IT-31
, Issue.2
, pp. 124-142
-
-
Gallager, R.1
-
14
-
-
33747450712
-
Decoding rule and error exponent bound for the random multiple-access channel
-
(Budapest, Hungary)
-
A. Satt and E. Plotnik, “Decoding rule and error exponent bound for the random multiple-access channel,” in Proc. 1991 IEEE Symp. on Information Theory (Budapest, Hungary, 1991), p. 216.
-
(1991)
Proc. 1991 IEEE Symp. on Information Theory
, pp. 216
-
-
Satt, A.1
Plotnik, E.2
-
15
-
-
84939048147
-
The asynchronous capacity region of T-out-of-M user codes
-
(Baltimore, MD, Mar.)
-
Y. Liu and B. Hughes, “The asynchronous capacity region of T-out-of-M user codes,” in Proc. 1993 Conf. on Information Science and Systems (Baltimore, MD, Mar. 1993), pp. 750–753.
-
(1993)
Proc. 1993 Conf. on Information Science and Systems
, pp. 750-753
-
-
Liu, Y.1
Hughes, B.2
-
16
-
-
0025517239
-
A class of codes for the T active users out of N multiple-access communication system
-
Nov.
-
P. Mathys, “A class of codes for the T active users out of N multiple-access communication system,” IEEE Trans. Inform. Theory, vol. 36, no. 6, pp. 1206–1219, Nov. 1990.
-
(1990)
IEEE Trans. Inform. Theory
, vol.36
, Issue.6
, pp. 1206-1219
-
-
Mathys, P.1
-
17
-
-
84939020971
-
Lattice codes for the Gaussian multiple-access channel
-
(Allerton, IL, Sept.)
-
B. Rimoldi, “Lattice codes for the Gaussian multiple-access channel,” in Proc. 31st Annual Allerton Conf. on Communications, Control and Computing (Allerton, IL, Sept. 1993), pp. 44–53.
-
(1993)
Proc. 31st Annual Allerton Conf. on Communications, Control and Computing
, pp. 44-53
-
-
Rimoldi, B.1
|