Multiuser broadcast erasure channel with feedback and side information, and related index coding results

  title={Multiuser broadcast erasure channel with feedback and side information, and related index coding results},
  author={Athanasios Papadopoulos and Leonidas Georgiadis},
  journal={2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
In this paper we consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally in wireless and in particular cognitive networks where a node may overhear transmitted messages destined to other nodes before transmission over a given broadcast channel begins. We provide an upper bound to the capacity region of this system… 

Figures and Tables from this paper

Linear network coding capacity region of the smart repeater with broadcast erasure channels

The proposed LNC inner bound introduces more advanced packing-mixing operations other than the previously well-known butterfly-style XOR operation on overheard packets of two co-existing flows and a new LNC outer bound is derived by exploring the inherent algebraic structure of the LNC problem.

General capacity region for the fully-connected 3-node packet erasure network

Technical contributions of this work include a new converse for many-to-many network communications and a new capacity-approaching simple linear network coding scheme.

General Capacity Region for the Fully Connected Three-Node Packet Erasure Network

The results effectively characterize the capacity region for many important scenarios, e.g., wireless access-point networks with client-to-client cooperative communications, and wireless two-way relay networks with packet-level coding and processing.

Index Coded Automatic Repeat Request (ARQ)

It is shown that two contradictory performance metrics such as transmission efficiency and transmit (receive) cache memory size for index coding (decoding) can be enhanced with a reasonable trade-off and the transmission efficiency of the proposed scheme is proved to be asymptotically optimal.

Multi-session Network Coding characterization using new linear coding frameworks

This thesis proposes a new Precoding-based Framework and its fundamental properties that can bridge between the point-to-point network channel and the underlying graph structures that turn out to be critical when characterizing graph-theoretically the feasibility of the Precoded-based solutions.



Multiuser Broadcast Erasure Channel with Feedback and Side Information, and its Relation Index Coding

This paper considers the N-user broadcast erasure channel with public feedback and side information with an upper bound to the capacity region of this system and shows that the bound is tight for the case of two- user broadcast channels.

Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms

A virtual-queue-based inter-session mixing coding algorithm is proposed, determine its rate region, and shows that it achieves capacity under certain conditions on channel statistics, assuming that instantaneous feedback is known to all users.

Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate

Using the information theoretic linear program introduced in Blasiak (2011), a polynomial-time algorithm is given for recognizing instances with β = 2 and pinpoint β precisely for various classes of graphs (e.g., various Cayley graphs of cyclic groups).

On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback

  • Chih-Chun Wang
  • Computer Science
    IEEE Transactions on Information Theory
  • 2012
Extensive numerical experiments show that the outer and inner bounds meet for almost all broadcast PECs encountered in practical scenarios and thus effectively bracket the capacity of general 1-to-K broadcast Pecs with COF.

Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels

This paper characterizes the full capacity region of the COPE principle for 2-flow wireless butterfly networks with broadcast packet erasure channels (PECs) and proposes a new class of linear network codes, named as the space-based linear network coding (SBLNC), that achieves the capacity outer bound.

Capacity and Stable Throughput Regions for the Broadcast Erasure Channel With Feedback: An Unusual Union

A source node broadcasting to two receivers over a general erasure channel with receiver feedback exhibits an unusual relationship between capacity and stability regions and extends similar prior studies for multiple access channels.

Broadcasting with Side Information

It is shown that usage of large data blocks may strictly improve upon the trivial encoding which treats each bit in the block independently, and provided general bounds on betat, and it is proved that for any constant C there is an explicit broadcast setting in which beta = 2 but beta1> C.

On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory

It is shown that vectorlinear codes outperform scalar linear index codes and that vector linear codes are insufficient for achieving the optimum number of transmissions.

On the capacity of 2-user 1-hop relay erasure networks — The union of feedback, scheduling, opportunistic routing, and network coding

  • W. KuoChih-Chun Wang
  • Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
Numerical experiments show that for commonly encountered scenarios, the gap between the inner and the outer bounds is less than 0.2%, which demonstrates the effectiveness of the proposed bounding techniques.

Random coding theorem for broadcast channels with degraded components

This paper generalizes Cover's results on broadcast channels with two binary symmetric channels (BSC) to the class of degraded channels with N components, and shows a procedure to expurgate a good random broadcast code leading to a bound on the maximum probability of error.