Optimal coding strategies for certain permuting channels

Ahlswede R, Kaspi AH (1987)
IEEE transactions on information theory 33(3): 310-314.

Download
OA
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Autor
;
Abstract / Bemerkung
We give optimal coding strategies for nonprobabilistic permuting (especially, "trapdoor") channels and also for a permuting relay channel. Our results open the door to a coding theory for nonprobabilistic (or deterministic) channels with memory.
Erscheinungsjahr
Zeitschriftentitel
IEEE transactions on information theory
Band
33
Zeitschriftennummer
3
Seite
310-314
ISSN
PUB-ID

Zitieren

Ahlswede R, Kaspi AH. Optimal coding strategies for certain permuting channels. IEEE transactions on information theory. 1987;33(3):310-314.
Ahlswede, R., & Kaspi, A. H. (1987). Optimal coding strategies for certain permuting channels. IEEE transactions on information theory, 33(3), 310-314. doi:10.1109/TIT.1987.1057313
Ahlswede, R., and Kaspi, A. H. (1987). Optimal coding strategies for certain permuting channels. IEEE transactions on information theory 33, 310-314.
Ahlswede, R., & Kaspi, A.H., 1987. Optimal coding strategies for certain permuting channels. IEEE transactions on information theory, 33(3), p 310-314.
R. Ahlswede and A.H. Kaspi, “Optimal coding strategies for certain permuting channels”, IEEE transactions on information theory, vol. 33, 1987, pp. 310-314.
Ahlswede, R., Kaspi, A.H.: Optimal coding strategies for certain permuting channels. IEEE transactions on information theory. 33, 310-314 (1987).
Ahlswede, Rudolf, and Kaspi, Amiram H. “Optimal coding strategies for certain permuting channels”. IEEE transactions on information theory 33.3 (1987): 310-314.
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