Index Codes with Minimum Locality for Three Receiver Unicast Problems

04/09/2019
by   Smiju Kodamthuruthil Joy, et al.
0

An index code for a broadcast channel with receiver side information is 'locally decodable' if every receiver can decode its demand using only a subset of the codeword symbols transmitted by the sender instead of observing the entire codeword. Local decodability in index coding improves the error performance when used in wireless broadcast channels, reduces the receiver complexity and improves privacy in index coding. The 'locality' of an index code is the ratio of the number of codeword symbols used by each receiver to the number message symbols demanded by the receiver. Prior work on locality in index coding have considered only single unicast and single-uniprior problems, and the optimal trade-off between broadcast rate and locality is known only for a few cases. In this paper we identify the optimal broadcast rate (including among non-linear codes) for all three receiver unicast problems when the locality is equal to the minimum possible value, i.e., equal to one. The index code that achieves this optimal rate is based on a clique covering technique and is well known. The main contribution of this paper is in providing tight converse results by relating locality to broadcast rate, and showing that this known index coding scheme is optimal when locality is equal to one. Towards this we derive several structural properties of the side information graphs of three receiver unicast problems, and combine them with information theoretic arguments to arrive at a converse.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/19/2019

Locally Decodable Index Codes

An index code for broadcast channel with receiver side information is lo...
research
01/17/2019

Locality in Index Coding for Large Min-Rank

An index code is said to be locally decodable if each receiver can decod...
research
01/11/2018

On Locally Decodable Index Codes

Index coding achieves bandwidth savings by jointly encoding the messages...
research
01/17/2019

On Index coding for Complementary Graphs with focus on Circular Perfect Graphs

Circular perfect graphs are those undirected graphs such that the circul...
research
06/20/2022

The Capacity of 3 User Linear Computation Broadcast

The K User Linear Computation Broadcast (LCBC) problem is comprised of d...
research
03/18/2019

On the Capacity of Computation Broadcast

The two-user computation broadcast problem is introduced as the setting ...

Please sign up or login with your details

Forgot password? Click here to reset