Optimal coding strategies for certain permuting channels

Authors:
Rudolf Ahlswede;Amiram H. Kaspi
Affiliations:
Univ. of Bielefeld, Beielefeld, West Germany;Israel Institute of Technology, Haifa, Israel
Venue:
IEEE Transactions on Information Theory
Year:
1987

Citing 0
Cited 5

Traffic adaptive relaying topology control

IEEE Transactions on Wireless Communications
Zero-error feedback capacity of channels with state information via dynamic programming

IEEE Transactions on Information Theory
Capacity problem of trapdoor channel

General Theory of Information Transfer and Combinatorics
Creating order and ballot sequences

Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	754.90

Visualization

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.