Advertisement

Bounds on the use of the postal channel

  • Ph. Piret
Section II Information Theory, Decoding And Cryptography
Part of the Lecture Notes in Computer Science book series (LNCS, volume 388)

Abstract

Recently Ahlswede and Kaspi have introduced a new type of problems in information theory. These problems arise in a situation where the information needs to be entrusted to a postman, which is able to modify (to some extent) the order of delivery of the transmitted letters. In this paper, we give a survey of the results obtained to date in the analysis of this postal channel and we suggest several generalizations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Ahlswede and A. Kaspi, “Optimal coding strategies for certain permuting channels,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 310–314, May 1987.CrossRefGoogle Scholar
  2. [2]
    K. Kobayashi, “Combinatorial structure and capacity of the permuting relay channel,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 813–826, November 1987.CrossRefGoogle Scholar
  3. [3]
    Ph. Piret, “Two results on the permuting mailbox channel,” IEEE Trans. Inform. Theory, to appear, 1989.Google Scholar
  4. [4]
    E. Seneta, Non-negative matrices, G. Allen & Unwin Ltd, 1973.Google Scholar
  5. [5]
    W.W. Peterson and E.J. Weldon, Error correcting codes, 2nd ed., MIT Press, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Ph. Piret
    • 1
  1. 1.Philips Research LaboratoryBrusselsBelgium

Personalised recommendations