Skip to main content
SpringerLink
Log in

Joint Source-Channel Coding Using Variable-Length Codes

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Jelinek, F., Probabilistic Information Theory, New York: McGraw Hill, 1968.

    Google Scholar 

  2. Csiszár, I., Joint Source-Channel Error Exponent, Probl. Control Inf. Theory, 1980, vol. 9,no. 5, pp. 315-328.

    Google Scholar 

  3. Csiszár, I., On the Error Exponent of Source-Channel Transmission with a Distortion Threshold, IEEE Trans. Inf. Theory, 1982, vol. 28,no. 6, pp. 823-828.

    Google Scholar 

  4. Ahlswede, R. and Gács, P., Two Contributions to Information Theory, in Topics in Information Theory (Proc. 2nd Colloq. on Inf. Theory, Keszthely, Hungary, 1975), Csiszár, I. and Elias, P., Eds., Colloq. Math. Soc. János Boliai, vol. 16, Amsterdam: North-Holland, 1977, pp. 17-40.

    Google Scholar 

  5. Viterbi, A.J., Error Bounds for Convolutional Codes and Asymptotically Optimum Decoding Algorithm, IEEE Trans. Inf. Theory, 1967, vol. 13,no. 2, pp. 260-269.

    Google Scholar 

  6. Gallager, R.G., A Simple Derivation of the Coding Theorem and Some Applications, IEEE Trans. Inf. Theory, 1965, vol. 11,no. 1, pp. 3-18.

    Google Scholar 

  7. Viterbi, A.J. and Omura, J.K., Principles of Digital Communication and Coding, New York: McGraw Hill, 1979.

    Google Scholar 

  8. Balakirsky, V.B., Prefix Codes for One Search Problem, Proc. All-Union Conf. on Reliability and Effectiveness of Information Transmission Systems, Odessa, 1986, pp. 58-59.

  9. Csiszár, I. and Körner, J., Information Theory: Coding Theorems for Discrete Memoryless Systems, New York: Academic, 1981.

    Google Scholar 

  10. Balakirsky, V.B., Joint Source-Channel Coding with Variable Length Codes, Proc. 1997 IEEE Int. Symp. on Information Theory, Ulm, 1997, p. 491.

Download references

Authors
  1. V. B. Balakirsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balakirsky, V.B. Joint Source-Channel Coding Using Variable-Length Codes. Problems of Information Transmission 37, 10–23 (2001). https://doi.org/10.1023/A:1010443525831

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010443525831

Keywords

Search

Navigation