|
Problemy Peredachi Informatsii, 2001, Volume 37, Issue 1, Pages 12–27
(Mi ppi506)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Coding Theory
Joint Source-Channel Coding Using Variable-Length Codes
V. B. Balakirskii
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.
Received: 11.08.1999 Revised: 13.06.2000
Citation:
V. B. Balakirskii, “Joint Source-Channel Coding Using Variable-Length Codes”, Probl. Peredachi Inf., 37:1 (2001), 12–27; Problems Inform. Transmission, 37:1 (2001), 10–23
Linking options:
https://www.mathnet.ru/eng/ppi506 https://www.mathnet.ru/eng/ppi/v37/i1/p12
|
Statistics & downloads: |
Abstract page: | 405 | Full-text PDF : | 172 | References: | 43 |
|