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
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Erscheinungsjahr
Zeitschriftentitel
J. Combinatorics, Information and System Sciences
Band
7
Zeitschriftennummer
3
Seite
216-230
PUB-ID

Zitieren

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.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
1970-01-01T00:00:00Z

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar