Joint source-channel coding using variable-length codes
From MaRDI portal
The paper presents a decoding algorithm for joint source-channel coding when variable-length codes are used for information transmission over a discrete memoryless channel. The asymptotic lower bound on the exponent of the decoding error probability for variable-length codes has been established. For a subclass of discrete memoryless sources and discrete memoryless channels, this bound is asymptotically tight.
Recommendations
- Joint source/channel coding for variable length codes
- Joint source and channel decoding for variable length encoded turbo codes
- Joint source-channel coded multidimensional modulation for variable-length codes
- Joint source-channel decoding of variable-length codes with soft information: a survey
- scientific article; zbMATH DE number 2036478
- Reduced-complexity trellises for the joint source-channel decoding of variable-length encoded data
- Joint source/channel coding using arithmetic codes
- Joint Source-Channel Coding With Time-Varying Channel and Side-Information
- Joint Source-Channel Coding With Feedback
- Joint design of fixed-rate source codes and multiresolution channel codes
Cited in
(7)- Joint source channel decoding and iterative symbol combining with turbo trellis-coded modulation
- Repeated joint source-channel decoding with reduced new bit errors
- Joint Source-Channel Coding With Time-Varying Channel and Side-Information
- Error correction performance analysis of error resilient arithmetic code
- Joint Source-Channel Coding With Feedback
- Near-capacity variable-length coding. Regular and EXIT-chart-aided irregular designs.
- Joint source-channel coded multidimensional modulation for variable-length codes
This page was built for publication: Joint source-channel coding using variable-length codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951358)