The Minrank of Random Graphs

IEEE Transactions on Information Theory, pp. 6990-6995, 2017.

Cited by: 13|Bibtex|Views38|Links
EI WOS
Keywords:
IndexesReceiversComplexity theoryChannel codingSparse matricesMore(1+)

Abstract:

The minrank of a directed graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching some ones to zeros (i.e., deleting edges) and then setting all diagonal entries to one. This quantity is closely related to the fundamental information-theoretic problems of (linear) index coding (Bar-Yossef...More

Code:

Data:

Your rating :
0

 

Tags
Comments