Linear Index Coding via Semidefinite Programming

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

Full description

Bibliographic Details

Published in:	Combinatorics, probability & computing Vol. 23; no. 2; pp. 223 - 247
Main Authors:	CHLAMTÁČ, EDEN, HAVIV, ISHAY
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.03.2014
Subjects:	Algorithms Coding Combinatorial analysis Graph coloring Graphs Optimization Receivers Upper bounds Primary 05C85
ISSN:	0963-5483, 1469-2163
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!