Optimal index codes with near-extreme rates
The min-rank of a digraph was shown by Bar-Yossef et al. (2006) to represent the length of an optimal scalar linear solution of the corresponding instance of the Index Coding with Side Information (ICSI) problem. In this work, the graphs and digraphs of near-extreme min-ranks are characterized. Thos...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2013
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/102539 http://hdl.handle.net/10220/16391 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|