A source matching approach to finding minimax codes (Q3869236)
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 3672185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A source matching approach to finding minimax codes |
scientific article; zbMATH DE number 3672185 |
Statements
A source matching approach to finding minimax codes (English)
0 references
1980
0 references
source matching
0 references
minimax codes for classes of memoryless sources
0 references
channel capacity problem
0 references
monotonic sources
0 references
Bernoulli-like source
0 references
extensions of finite alphabet memoryless sources
0 references
Lynch-Davisson code
0 references
0.8891938328742981
0 references
0.8363541960716248
0 references
0.7875802516937256
0 references
0.7535872459411621
0 references
