TY  - JOUR
AB  - 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.
DA  - 1987
DO  - 10.1109/TIT.1987.1057313
LA  - eng
IS  - 3
M2  - 310
PY  - 1987
SN  - 0018-9448
SP  - 310-314
T2  - IEEE transactions on information theory
TI  - Optimal coding strategies for certain permuting channels
UR  - https://nbn-resolving.org/urn:nbn:de:0070-bipr-21010
Y2  - 2024-11-22T05:28:42
ER  -