Optimal coding strategies for certain permuting channels

@article{Ahlswede1987OptimalCS,
  title={Optimal coding strategies for certain permuting channels},
  author={Rudolf Ahlswede and Andr{\'e} Kaspi},
  journal={IEEE Trans. Information Theory},
  year={1987},
  volume={33},
  pages={310-314}
}
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. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 31 CITATIONS

Universal Privacy Guarantees for Smart Meters

  • 2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Smart meter privacy via the trapdoor channel

  • 2017 IEEE International Conference on Smart Grid Communications (SmartGridComm)
  • 2017
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Capacity of the Trapdoor Channel With Feedback

  • IEEE Transactions on Information Theory
  • 2006
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Recursions for the trapdoor channel and an upper bound on its capacity

  • 2014 IEEE International Symposium on Information Theory
  • 2014
VIEW 2 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Privacy-Aware Smart Metering: Progress and Challenges

  • IEEE Signal Processing Magazine
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND