### Abstract

We address the problem of joint source-channel coding when variable-length codes are used for information transmission over a discrete memoryless channel. Data transmitted over the channel are interpreted as pairs (m k ,t k ), where m k is a message generated by the source and t k is a time instant when the transmission of the kth codeword begins. The decoder constructs an estimate of the transmitted sequence of pairs, and the kth decoding error is introduced as the event that the pair (m k ,t k ) does not belong to this sequence. We describe the maximum likelihood decoding algorithm and prove a lower bound on the exponent of the decoding error probability. For a subclass of discrete memoryless sources and discrete memoryless channels, this bound is asymptotically tight.

Original language | English |
---|---|

Pages (from-to) | 10-23 |

Number of pages | 14 |

Journal | Problems of Information Transmission |

Volume | 37 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2001 |

## Fingerprint Dive into the research topics of 'Joint source-channel coding using variable length codes'. Together they form a unique fingerprint.

## Cite this

Balakirsky, V. B. (2001). Joint source-channel coding using variable length codes.

*Problems of Information Transmission*,*37*(1), 10-23. https://doi.org/10.1023/A:1010443525831