Results 1  10
of
10
Erasure correction for nested receivers
"... Abstract—We consider packet erasure or error correction coding for a nested receiver structure, where each receiver receives a subset of the packets received by the next receiver. This type of structure arises, for instance, with temporal demands, where each receiver corresponds to a deadline by whi ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
(Show Context)
Abstract—We consider packet erasure or error correction coding for a nested receiver structure, where each receiver receives a subset of the packets received by the next receiver. This type of structure arises, for instance, with temporal demands, where each receiver corresponds to a deadline by which certain information must be decoded. By making a connection with our previous work on nonmulticast network error correction, we find the capacity region for any given number of erasures or errors whose locations are a priori unknown, along with a capacityachieving intrasession coding scheme. I.
Outer bounds on the error correction capacity region for nonmulticast
"... networks ..."
(Show Context)
LowComplexity NonUniform Demand Multicast Network Coding Problems
"... Abstract — The nonuniform demand network coding problem is posed as a singlesource and multiplesink network transmission problem where the sinks may have heterogeneous demands. In contrast with multicast problems, nonuniform demand problems are concerned with the amounts of data received by each ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — The nonuniform demand network coding problem is posed as a singlesource and multiplesink network transmission problem where the sinks may have heterogeneous demands. In contrast with multicast problems, nonuniform demand problems are concerned with the amounts of data received by each sink, rather than the specifics of the received data. In this work, we enumerate nonuniform network demand scenarios under which network coding solutions can be found in polynomial time. This is accomplished by relating the demand problem with the graph coloring problem, and then applying results from the strong perfect graph theorem to identify coloring problems which can be solved in polynomial time. This characterization of efficientlysolvable nonuniform demand problems is an important step in understanding such problems, as it allows us to better understand situations under which the NPcomplete problem might be tractable. I.
On Multicasting Nested Message Sets Over Combination Networks
"... Abstract—In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the high ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public and any number of private receivers, where achievability is through linear coding. Our encoding scheme is general and characterizes an achievable region for arbitrary number of public and private receivers 1. I.
On Broadcast with a Common Message over Networks
"... We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable rate region is given by the cutset bounds. F ..."
Abstract
 Add to MetaCart
We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable rate region is given by the cutset bounds. From the cutset bounds, we get R o to be an outer bound to the rate region R (R ⊆ R o). For the case K = 2, it was shown in [1],[6],[5] that the cutset bound is tight. It was observed in [4] that the cutset bound is not necessarily tight when K> 2. The authors provide the example of the network in Figure 1. The network does not support the rate point (1, 0, 1, 0) even though it lies in R o. The authors also demonstrate achievable rates by combining the technique of network coding and linear precoding at the source. In this work, we show a class of networks for which the cutset bound is tight. This class consists of all acyclic networks for which the mincuts are characters t1 t2 t3 Figure 1: Network for which the cutset bound is not tight. All links have unit capacity. 1.
1 Capacity Results for Multicasting Nested Message Sets over Combination Networks
"... ar ..."
(Show Context)
unknown title
, 2013
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.