Arbitrarily varying channels with states sequence known to the sender

Ahlswede R (1986)
IEEE transactions on information theory 32(5): 621-629.

Download
OA
Journal Article | Published | English
Abstract
The capacity of the arbitrarily varying channels with states sequence known to the sender is determined. The result is obtained with the help of an elimination technique and a robustification technique. It demonstrates once more the power of these techniques.
Publishing Year
ISSN
PUB-ID

Cite this

Ahlswede R. Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory. 1986;32(5):621-629.
Ahlswede, R. (1986). Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory, 32(5), 621-629.
Ahlswede, R. (1986). Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory 32, 621-629.
Ahlswede, R., 1986. Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory, 32(5), p 621-629.
R. Ahlswede, “Arbitrarily varying channels with states sequence known to the sender”, IEEE transactions on information theory, vol. 32, 1986, pp. 621-629.
Ahlswede, R.: Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory. 32, 621-629 (1986).
Ahlswede, Rudolf. “Arbitrarily varying channels with states sequence known to the sender”. IEEE transactions on information theory 32.5 (1986): 621-629.
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

Web of Science

View record in Web of Science®

Search this title in

Google Scholar