Average-sense optimality and competitive optimality for almost instantaneous VF codes (Q4544662)
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 1775930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-sense optimality and competitive optimality for almost instantaneous VF codes |
scientific article; zbMATH DE number 1775930 |
Statements
Average-sense optimality and competitive optimality for almost instantaneous VF codes (English)
0 references
4 August 2002
0 references
competitive optimality
0 references
almost instantaneous variable-to-fixed length codes
0 references
one-shot coding
0 references
Tunstall code
0 references
0.7729278206825256
0 references
0.7729278206825256
0 references
0.7597364187240601
0 references
0.7518571615219116
0 references
