A lower bound on the encoding length in lossy transmission (Q1818962)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1818962 |
scientific article; zbMATH DE number 1384903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the encoding length in lossy transmission |
scientific article; zbMATH DE number 1384903 |
Statements
A lower bound on the encoding length in lossy transmission (English)
0 references
5 January 2000
0 references
In order to solve the packet-loss problem over heterogeneous networks the authors analyze a model in which a subset of packets and a threshold correspond to each message, so that a message can be recovered from a number of packets not less than the threshold. In particular, they prove a tight lower bound on the encoding length in such a model, when two messages are transmitted.
0 references
packet-based transmission
0 references
threshold circuit
0 references
packet-loss problem
0 references
heterogeneous networks
0 references
0.7746726274490356
0 references
0.7710291147232056
0 references
0.7203699350357056
0 references
