We establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton’s inner bound for a variety of classes of product broadcast channels whose capacity regions were previously unknown. These classes include product of reversely semi-deterministic and product of reversely more-capable channels. A significant consequence of this new outer bound is...

One of the most important applications in visual analytics has been exploratory visual analysis of large collections of unstructured text documents. However, digital media, especially those on the Internet, are multimedia in content with text, images, video, and even sound together. Furthermore, there is an explosion of broadcast and other media, especially in third world countries. (In the Mid...

We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of the outer bound for various classes of networks. An important engineering implication of this work is that for network coding schemes for parallel broadcast ...

Previous researches on broadcast scheduling assume that once a client generates a request, this request will not be discarded until it is satisfied. However, if a client needs the traffic information to decide which road to drive, he must receive the response before he reaches the crossroad. Some recent works begin to address the transmission of the real-time database. The pinwheel scheduling p...

In real-time environments, information is disseminated to clients under timing constraints. In this paper, we focus on the real time data scheduling problem in multiple broadcast channels environments, where the clients are equipped with multiple receivers. Each request is associated with a deadline. The clients can either retrieve data items from the broadcast channels or send requests to the ...

We introduce techniques that shed new light on the capacity analysis of multiuser channels, and apply these techniques to broadcast and multiple access channels. We rst determine a duality between broadcast and multiple access channels that can be used to obtain the capacity region and optimal transmission strategy for one channel based on the capacity-achieving transmission strategy and region...

This paper gives an overview on techniques for quickly finding items that are broadcast on multiple data channels. Previous works assume that throughput increases with the number of data channels because the total available bandwidth increases. This assumption, however, rests on the client’s ability read data as soon as it is broadcast on any channel. Without this ability, the benefit of additi...