Bounded Delay Timed Channel Coding.

We consider the problem of timed channel coding: given two timed languages, can we transmit the information produced by the first, used as information source, as words of the second, used as communication channel? More precisely, we look at coding with bounded delay: having a uniform bound between the timed length of any word from the source and its encoding on the channel. Moreover, we consider approximated coding satisfying the following property: whenever the channel word is observed with precision epsilon', then the original word can be recovered with precision epsilon. Our solution is based on the new notion of e-bandwidth of a timed language, which characterises the quantity of information in its words, in bits per time unit, when these words are observed with precision epsilon. We present basic properties of epsilon-bandwidth of timed regular languages, and establish a necessary, and a sufficient simple condition for existence of bounded delay coding in terms of bandwidths of the source and the channel.