-
1
-
-
0002195239
-
Multi-way communication channels
-
Tsahkadsor, USSR
-
R. Ahlswede, “Multi-way communication channels,” in Proc. 2nd Int. Symp. Information Theory, Tsahkadsor, USSR, 1971, pp. 103-135.
-
(1971)
Proc. 2nd Int. Symp. Information Theory
, pp. 103-135
-
-
Ahlswede, R.1
-
2
-
-
0000456843
-
The capacity region of a channel with two senders and tworeceivers
-
Oct.
-
“The capacity region of a channel with two senders and tworeceivers,” Ann. Prob., vol. 2, pp. 805-814, Oct. 1974.
-
(1974)
Ann. Prob.
, vol.2
, pp. 805-814
-
-
-
3
-
-
0008716389
-
Some advances in broadcast channels
-
New York: Academic
-
T. Cover, “Some advances in broadcast channels,” Advances in Communication Systems, vol. 4. New York: Academic, 1975, pp. 229-260.
-
(1975)
Advances in Communication Systems
, vol.4
, pp. 229-260
-
-
Cover, T.1
-
4
-
-
0015992185
-
Recent results in the Shannon theory
-
Jan.
-
A. D. Wyner, “Recent results in the Shannon theory,” IEEE Trans. Inform. Theory, vol. IT-20, Jan. 1974.
-
(1974)
IEEE Trans. Inform. Theory
, vol.IT-20
-
-
Wyner, A.D.1
-
5
-
-
0003090330
-
Coding in an asynchronous multiple-access channel
-
July-Sept.
-
G. Sh. Poltyrev, “Coding in an asynchronous multiple-access channel,” Problems Inform. Transmission, pp. 12-21, July-Sept. 1983.
-
(1983)
Problems Inform. Transmission
, pp. 12-21
-
-
Poltyrev, G.S.H.1
-
6
-
-
0022031156
-
The capacity region of the totally asynchronous multiple-access channels
-
Mar.
-
J. Y. N. Hui and P. A. Humblet, “The capacity region of the totally asynchronous multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 207-216, Mar. 1985.
-
(1985)
IEEE Trans. Inform. Theory
, vol.IT-31
, pp. 207-216
-
-
Hui, J.Y.N.1
Humblet, P.A.2
-
7
-
-
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. IT-35, pp. 605-619, May 1989.
-
(1989)
IEEE Trans. Inform. Theory
, vol.IT-35
, pp. 605-619
-
-
Verdú, S.1
-
8
-
-
0018018507
-
Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs
-
Sept.
-
M. A. Deaett and J. K. Wolf, “Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs,” IEEE Trans, Inform. Theory, vol. IT-24, pp. 63-64, Sept. 1978.
-
(1978)
IEEE Trans, Inform. Theory
, vol.IT-24
, pp. 63-64
-
-
Deaett, M.A.1
Wolf, J.K.2
-
9
-
-
0021466789
-
Throughput analysis for code division multiple accessing of the spread spectrum channel
-
July
-
J. Y. N. Hui, “Throughput analysis for code division multiple accessing of the spread spectrum channel,” IEEE J. Selected Areas Commun., vol. SAC-2, pp. 482-486, July 1984.
-
(1984)
IEEE J. Selected Areas Commun.
, vol.SAC-2
, pp. 482-486
-
-
Hui, J.Y.N.1
-
10
-
-
84941523688
-
Efficiency of channel use in asynchronous address systems with code address
-
Apr.-June
-
G. Tartara, “Efficiency of channel use in asynchronous address systems with code address,” Problems Inform. Transmission, vol. 6, pp. 144-147, Apr.-June 1970.
-
(1970)
Problems Inform. Transmission
, vol.6
, pp. 144-147
-
-
Tartara, G.1
-
11
-
-
84938444436
-
Asynchronously multiplexed channel capacity
-
Jan.
-
R. C. Sommer, “Asynchronously multiplexed channel capacity,” Proc. IEEE, vol. 54, pp. 79-80, Jan. 1966.
-
(1966)
Proc. IEEE
, vol.54
, pp. 79-80
-
-
Sommer, R.C.1
-
14
-
-
0002031137
-
Capacity region of Gaussian CDMA channels: The symbol-synchronous case
-
Oct.
-
S. Verdú, “Capacity region of Gaussian CDMA channels: The symbol-synchronous case,” in Proc. 24th Allerton Conf., Oct. 1986, pp. 1025-1034.
-
(1986)
Proc. 24th Allerton Conf.
, pp. 1025-1034
-
-
Verdú, S.1
-
17
-
-
84879705487
-
Eigenwerte verallgemeinerter Toeplitzschen Matrizen
-
B. Gyires, “Eigenwerte verallgemeinerter Toeplitzschen Matrizen,” Publ. Math. Debrecen, vol. 4, pp. 171-179, 1956.
-
(1956)
Publ. Math. Debrecen
, vol.4
, pp. 171-179
-
-
Gyires, B.1
-
20
-
-
0040431838
-
Strictly concave parametric programming, Part I: Basic theory
-
Nov.
-
A. M. Geoffrion, “Strictly concave parametric programming, Part I: Basic theory,” Management Sci., vol. 13, pp. 244-253, Nov. 1966.
-
(1966)
Management Sci.
, vol.13
, pp. 244-253
-
-
Geoffrion, A.M.1
-
22
-
-
0018530610
-
A sinusoidal family of unitary transforms
-
Oct.
-
A. K. Jain, “A sinusoidal family of unitary transforms,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-1, pp. 356-365, Oct. 1979.
-
(1979)
IEEE Trans. Pattern Anal. Mach. Intell.
, vol.PAMI-1
, pp. 356-365
-
-
Jain, A.K.1
-
23
-
-
0015431807
-
On the asymptotic eigenvalue distribution of Toeplitz matrices
-
Nov.
-
R. M. Gray, “On the asymptotic eigenvalue distribution of Toeplitz matrices,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 725-730, Nov. 1972.
-
(1972)
IEEE Trans. Inform. Theory
, vol.IT-18
, pp. 725-730
-
-
Gray, R.M.1
-
24
-
-
84911837213
-
Communication in the presence of noise
-
Jan.
-
C. E. Shannon, “Communication in the presence of noise,” Proc. IRE, vol. 37, pp. 10-21, Jan. 1949.
-
(1949)
Proc. IRE
, vol.37
, pp. 10-21
-
-
Shannon, C.E.1
-
27
-
-
0022581781
-
Minimum probability of error for asynchronous Gaussian multiple-access channels
-
Jan.
-
S. Verdú, “ Minimum probability of error for asynchronous Gaussian multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 85-96, Jan. 1986.
-
(1986)
IEEE Trans. Inform. Theory
, vol.IT-32
, pp. 85-96
-
-
Verdú, S.1
-
28
-
-
0022034656
-
A perspective on multiaccess channels
-
Mar.
-
R. G. Gallager, “A perspective on multiaccess channels,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 124-142, Mar. 1985.
-
(1985)
IEEE Trans. Inform. Theory
, vol.IT-31
, pp. 124-142
-
-
Gallager, R.G.1
-
31
-
-
0019063738
-
Optimal phases of maximal sequences for asynchronous spreadspectrum multiplexing
-
Sept. 11
-
F. D. Garber and M. B. Pursley, “Optimal phases of maximal sequences for asynchronous spreadspectrum multiplexing,” Electron. Lett., vol. 16, no. 19, pp. 756-757, Sept. 11, 1980.
-
(1980)
Electron. Lett.
, vol.16
, Issue.19
, pp. 756-757
-
-
Garber, F.D.1
Pursley, M.B.2
-
32
-
-
0020849106
-
An informationtheoretic proof of Hadamard's inequality
-
Nov.
-
T. Cover and A. El Gamal, “An informationtheoretic proof of Hadamard's inequality,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 930-931, Nov. 1983.
-
(1983)
IEEE Trans. Inform. Theory
, vol.IT-29
, pp. 930-931
-
-
Cover, T.1
El Gamal, A.2
|