Optimal coding strategies for certain permuting channels

DOI10.1109/TIT.1987.1057313MaRDI QIDQ3772125zbMATH OpenOpenAlexFDO

Authors Amiram H. Kaspi, Rudolf Ahlswede

Publication date 1987

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1987.1057313

zbMATH Keywords

Nonprobabilistic channelsoptimal coding strategiespermuting jammer channelspermuting relay channelstrapdoor channel

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Combinatorial structure and capacity of the permuting relay channel
• Optimal permutation codes for the Gaussian channel
• Codes for the asymmetric broadcast channel, generated by permutations (Corresp.)
• scientific article; zbMATH DE number 3972784
• Signaling Over Arbitrarily Permuted Parallel Channels

Cited in

(8)

• scientific article; zbMATH DE number 4016763 (Why is no real title available?)
• Signaling Over Arbitrarily Permuted Parallel Channels
• scientific article; zbMATH DE number 3972784 (Why is no real title available?)
• Combinatorial structure and capacity of the permuting relay channel
• Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
• Creating order and ballot sequences
• Information-Theoretic Foundations of DNA Data Storage
• Creating order in sequence spaces with simple machines

This page was built for publication: Optimal coding strategies for certain permuting channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3772125)