On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.) (Q3028866)
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 4016765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.) |
scientific article; zbMATH DE number 4016765 |
Statements
On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.) (English)
0 references
1987
0 references
optimal binary prefix-condition code
0 references
lower bound
0 references
redundancy
0 references
memoryless source
0 references
upper bounds
0 references
0.9206872
0 references
0.9114756
0 references
0.91133606
0 references
0.91099536
0 references
0.8998425
0 references
0.88718146
0 references
0.8809917
0 references
0.8800405
0 references
0.87951165
0 references
