Informed-source coding-on-demand (ISCOD) over broadcast channels

Birk, Yitzhak; Kol, Tomer

doi:10.1109/infcom.1998.662940

Cited by 317 publications

(454 citation statements)

References 10 publications

Supporting

Mentioning

454

Contrasting

Order By: Relevance

“…Recently, the following class of instances, schemes for which are called index coding, has received particular attention [2], [3]. The source at each time step is a vector of independent and identically distributed (i.i.d.)…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Vector Gaussian rate-distortion with variable side information

Unal

Wagner

2014

2014 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

We consider rate-distortion with two decoders, each with distinct side information. This problem is well understood when the side information at the decoders satisfies a certain degradedness condition. We consider cases in which this degradedness condition is violated but the source and the side information consist of jointly Gaussian vectors. We provide a hierarchy of four lower bounds on the optimal rate. These bounds are then used to determine the optimal rate for several classes of instances.

show abstract

Section: Introductionmentioning

confidence: 99%

“…2 Unless otherwise is stated, we assume that all Gaussian random variables are zero mean. 3 A B means that B − A is a positive semidefinite matrix.…”

Section: Introductionmentioning

confidence: 99%

Vector Gaussian rate-distortion with variable side information

Unal

Wagner

2014

2014 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…While the static index coding problem has been studied before [6][5] [4], our work provides new insight even in the static case. We introduce a new directed bipartite demand graph that allows for arbitrary demand subsets and possibly "multiple multicast" situations, where some packets are desired by more than one user.…”

Section: Methods For Completing a General Index Coding Mission Inmentioning

confidence: 99%

Dynamic index coding for wireless broadcast networks

Neely

Tehrani

Zhang

2012

2012 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of side information, and is a generalization of the well known (and unsolved) index coding problem of information theory. Rather than achieving the full capacity region, we develop a code-constrained capacity region, which restricts attention to a pre-specified set of coding actions. We develop a dynamic maxweight algorithm that allows for random packet arrivals and supports any traffic inside the code-constrained capacity region. Further, we provide a simple set of codes based on cycles in the underlying demand graph. We show these codes are optimal for a class of broadcast relay problems.

show abstract

“…Moreover, offline problems can be particularly interesting and challenging on their own, as the works on Index Coding [6,5,19,2] show.…”

Section: Definitionmentioning

confidence: 99%

Real-time delay with network coding and feedback

Drinea

Keller

Fragouli

2013

Physical Communication

View full text Add to dashboard Cite

We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of µ messages to several receivers. The sender can broadcast a single message or a combination (encoding) of messages to all receivers at each timestep, through separate erasure channels. Receivers provide feedback as to whether the transmission was received. If, at some time step, a receiver cannot identify a new message, delay is incurred. Our notion of delay is motivated by real-time applications that request progressively refined input, such as the successive refinement of an image encoded using multiple description coding.Our setup is novel because it combines coding techniques with feedback information to the end of minimizing delay. Uncoded scheduling or use of erasure correction coding, such as maximum distance separable (MDS) codes, has been well-studied in the literature. We show that our setup allows Θ(µ) benefits as compared to both previous approaches for offline algorithms, while feedback allows online algorithms to achieve smaller delay compared to online algorithms without feedback.Our main complexity results are that the offline minimization problem is N P -hard when the sender only schedules single messages and that the general problem remains N P -hard even when coding is allowed. However we show that coding does offer complexity gains by exhibiting specific classes of erasure instances that become trivial under coding schemes. We also discuss online heuristics and evaluate their performance through simulations.

show abstract

Informed-source coding-on-demand (ISCOD) over broadcast channels

Cited by 317 publications

References 10 publications

Vector Gaussian rate-distortion with variable side information

Vector Gaussian rate-distortion with variable side information

Dynamic index coding for wireless broadcast networks

Real-time delay with network coding and feedback

Contact Info

Product

Resources

About