Zero-error instantaneous coding of correlated sources with length constraints is NP-complete (Q3547831)
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 5455148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Zero-error instantaneous coding of correlated sources with length constraints is NP-complete |
scientific article; zbMATH DE number 5455148 |
Statements
Zero-error instantaneous coding of correlated sources with length constraints is NP-complete (English)
0 references
21 December 2008
0 references
correlated sources
0 references
Kraft inequality
0 references
NP-complete problem
0 references
prefix condition
0 references
rectangle packing
0 references
zero-error variable-length codes
0 references
0.8163055777549744
0 references
0.8104372024536133
0 references
0.8040817975997925
0 references
0.7539523839950562
0 references
0.7538872361183167
0 references
