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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Ahlswede and A. Kaspi, “Optimal coding strategies for certain permuting channels,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 310–314, May 1987.
K. Kobayashi, “Combinatorial structure and capacity of the permuting relay channel,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 813–826, November 1987.
Ph. Piret, “Two results on the permuting mailbox channel,” IEEE Trans. Inform. Theory, to appear, 1989.
E. Seneta, Non-negative matrices, G. Allen & Unwin Ltd, 1973.
W.W. Peterson and E.J. Weldon, Error correcting codes, 2nd ed., MIT Press, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Piret, P. (1989). Bounds on the use of the postal channel. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019848
Download citation
DOI: https://doi.org/10.1007/BFb0019848
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51643-9
Online ISBN: 978-3-540-46726-7
eBook Packages: Springer Book Archive