Bounds on entanglement-assisted source-channel coding via the Lovász ϑ number and its variants
We study zero-error entanglement-assisted source-channel coding (communication in the presence of side information). Adapting a technique of Beigi, we show that such coding requires existence of a set of vectors satisfying orthogonality conditions related to suitably defined graphs G and H. Such vec...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2015
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/103786 http://hdl.handle.net/10220/24586 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |