Optimal index codes with near-extreme rates

• المؤلفون الرئيسيون: Dau, Son Hoang, Skachek, Vitaly, Chee, Yeow Meng
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2013
• الموضوعات: DRNTU::Science::Mathematics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/102539; http://hdl.handle.net/10220/16391
• المؤسسة: Nanyang Technological University

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...