期刊论文详细信息
| Electronic Journal Of Combinatorics | |
| Coloring Chains for Compression with Uncertain Priors | |
| Noah Golowich1 | |
| 关键词: Graph coloring; Independent system; Source coding; | |
| DOI : | |
| 学科分类：离散数学和组合数学 | |
| 来源: Electronic Journal Of Combinatorics | |
 PDF
|
|
【 摘 要 】
Haramaty and Sudan considered the problem of transmitting a message between two people, Alice and Bob, when Alice's and Bob's priors on the message are allowed to differ by at most a given factor. To find a deterministic compression scheme for this proble【 授权许可】
Others
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201909029481411ZK.pdf | 335KB |  download |
878987797
028-85220240
