Tight bounds for the sequence transmission problem

We investigate the problem of transmitting sequences over unreliable channels where both the data items and the message alphabet have finite domains. We show tight bounds on the number of different sequences that can be transmitted (as a function of size of the message alphabet) when the channel can (1) reorder and duplicate messages and (2) reorder and delete messages. All of our results are derived using formal reasoning about, knowledge.