Linear Index Coding via Semidefinite Programming
Eden Chlamtáč,Ishay Haviv +1 more
29
TL;DR: A polynomial-time algorithm that, given an n-vertex graph G with minrank k, finds a linear index code for G of length Õ(nf(k), where f(k) depends only on k, yields a tight gap between two classical upper bounds on the Shannon capacity of a graph.
read more
Abstract: In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n-bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef, Birk, Jayram and Kol, IEEE Trans. Inform. Theory, 2011).We show a polynomial-time algorithm that, given an n-vertex graph G with minrank k, finds a linear index code for G of length O(nf(k)), where f(k) depends only on k. For example, for k = 3 we obtain f(3) ≈ 0.2574. Our algorithm employs a semidefinite program (SDP) introduced by Karger, Motwani and Sudan for graph colouring (J. Assoc. Comput. Mach., 1998) and its refined analysis due to Arora, Chlamtac and Charikar (STOC, 2006). Since the SDP we use is not a relaxation of the minimization problem we consider, a crucial component of our analysis is an upper bound on the objective value of the SDP in terms of the minrank.At the heart of our analysis lies a combinatorial result which may be of independent interest. Namely, we show an exact expression for the maximum possible value of the Lovasz ϑ-function of a graph with minrank k. This yields a tight gap between two classical upper bounds on the Shannon capacity of a graph.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications
TL;DR: This paper review instantly decodable network coding schemes by identifying, categorizing, and evaluating various algorithms proposed in the literature, and identifies numerous successful schemes from both the performance and complexity viewpoints.
Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques
TL;DR: It is shown that the interlinked-cycle-cover scheme can outperform all the existing graph-based schemes (including partial-clique-cover and fractional-local-chromatic number schemes), and a random-coding scheme for certain graphs.
58
Data Dissemination With Side Information and Feedback
TL;DR: Numerical results show that the number of transmissions required by the heuristic algorithm and the lower bound both grow roughly linearly with thenumber of users, and theHeuristic algorithm outperforms some benchmark algorithms.
43
The Minrank of Random Graphs
TL;DR: The lower bound matches the well-known upper bound obtained by the “clique covering” solution and settles the linear index coding problem for random knowledge graphs.
20
Topological bounds on the dimension of orthogonal representations of graphs
TL;DR: In this paper, the Borsuk-Ulam theorem was used to prove lower bounds on the dimension of orthogonal representations of graphs using algebraic topology, which strengthened the Kneser conjecture.
References
An introduction to probability theory and its applications - 3/E. volume 3
William Feller
- 22 Mar 2002
Abstract: The classic text for understanding complex statistical probability An Introduction to Probability Theory and Its Applications offers comprehensive explanations to complex statistical problems. Delving deep into densities and distributions while relating critical formulas, processes and approaches, this rigorous text provides a solid grounding in probability with practice problems throughout. Heavy on application without sacrificing theory, the discussion takes the time to explain difficult topics and how to use them. This new second edition includes new material related to the substitution of probabilistic arguments for combinatorial artifices as well as new sections on branching processes, Markov chains, and the DeMoivreLaplace theorem.
21.5K
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
9.3K
On the Shannon capacity of a graph
TL;DR: It is proved that the Shannon zero-error capacity of the pentagon is \sqrt{5} and a well-characterized, and in a sense easily computable, function is introduced which bounds the capacity from above and equals the capacity in a large number of cases.
The zero error capacity of a noisy channel
TL;DR: It is shown that while the ordinary capacity of a memoryless channel with feedback is equal to that of the same channel without feedback, the zero error capacity may be greater and a solution is given to the problem of evaluating C_oF.
1.7K