An elementary proof of the strong converse theorem for the multiple-access channel

Ahlswede R (1982)
J. Combinatorics, Information and System Sciences 7(3): 216-230.

Download
OA
Journal Article | Published | English
Publishing Year
PUB-ID

Cite this

Ahlswede R. An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences. 1982;7(3):216-230.
Ahlswede, R. (1982). An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences, 7(3), 216-230.
Ahlswede, R. (1982). An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences 7, 216-230.
Ahlswede, R., 1982. An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences, 7(3), p 216-230.
R. Ahlswede, “An elementary proof of the strong converse theorem for the multiple-access channel”, J. Combinatorics, Information and System Sciences, vol. 7, 1982, pp. 216-230.
Ahlswede, R.: An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences. 7, 216-230 (1982).
Ahlswede, Rudolf. “An elementary proof of the strong converse theorem for the multiple-access channel”. J. Combinatorics, Information and System Sciences 7.3 (1982): 216-230.
Main File(s)
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar