48 citations · 68 across the 25 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.DS2011
Linear Index Coding via Semidefinite Programming
Eden Chlamtac, Ishay Haviv
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…
cs.IT2011★ 6 cited
On Linear Index Coding for Random Graphs
Ishay Haviv, Michael Langberg
A sender wishes to broadcast an n character word x in F^n (for a field F) to n receivers R_1,...,R_n. Every receiver has some side information on x consisting of a subset of the ch…
cs.IT2011
Beating the Gilbert-Varshamov Bound for Online Channels
Ishay Haviv, Michael Langberg
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x =(x_1,...,x_n) in {0,1}^n bit by bit via a channel limited t…