Bounds on the use of the postal channel
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.
Unable to display preview. Download preview PDF.
- Ph. Piret, “Two results on the permuting mailbox channel,” IEEE Trans. Inform. Theory, to appear, 1989.Google Scholar
- E. Seneta, Non-negative matrices, G. Allen & Unwin Ltd, 1973.Google Scholar
- W.W. Peterson and E.J. Weldon, Error correcting codes, 2nd ed., MIT Press, 1972.Google Scholar