Joint source-channel coding using variable-length codes (Q5951358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1685489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Joint source-channel coding using variable-length codes |
scientific article; zbMATH DE number 1685489 |
Statements
Joint source-channel coding using variable-length codes (English)
0 references
7 March 2003
0 references
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.
0 references
joint source-channel coding
0 references
variable-length codes
0 references
discrete memoryless channel
0 references
error probability
0 references
decoding algorithm
0 references
0.9936646
0 references
0.9475624
0 references
0.9468108
0 references
0.9183237
0 references
0.89827263
0 references
0.8981345
0 references
0.88903224
0 references
0.8877094
0 references
