Optimal coding strategies for certain permuting channels

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

Download
OA
Journal Article | Published | English
Author
;
Abstract
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.
Publishing Year
ISSN
PUB-ID

Cite this

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.
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.
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