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

Rouayheb, Salim El; Sprintson, Alex; Georghiades, C.N.

doi:10.1109/tit.2010.2048502

Cited by 279 publications

(314 citation statements)

References 29 publications

Supporting

Mentioning

312

Contrasting

Order By: Relevance

“…due to related extensions such as secure broadcast, broadcasting with side information, and index coding [14], [15]). Several practical codes have been designed.…”

Section: B Relation To Prior Work 1) Deterministic Broadcast Channelsmentioning

confidence: 99%

Polar codes for broadcast channels

Goela

Abbé

Gastpar

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m independent messages to one codeword while satisfying broadcast constraints. The polarization-based codes achieve rates on the boundary of the private-message capacity region. For two-user noisy broadcast channels, polar implementations are presented for two information-theoretic schemes: i) Cover's superposition codes; ii) Marton's codes. Due to the structure of polarization, constraints on the auxiliary and channel-input distributions are identified to ensure proper alignment of polarization indices in the multi-user setting. The codes achieve rates on the capacity boundary of a few classes of broadcast channels (e.g., binary-input stochastically degraded). The complexity of encoding and decoding is O(n log n) where n is the block length. In addition, polar code sequences obtain a stretched-exponential decay of O(2 −n β ) of the average block error probability where 0 < β < 1 2 .

show abstract

“…due to related extensions such as secure broadcast, broadcasting with side information, and index coding [14], [15]). Several practical codes have been designed.…”

Section: B Relation To Prior Work 1) Deterministic Broadcast Channelsmentioning

confidence: 99%

Polar codes for broadcast channels

Goela

Abbé

Gastpar

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…The algorithm will back off window according to the priority to dynamically adjust the node, compared with DCF back off algorithm for BEB, not simply fixed length increases or decreases, so as to ensure the high priority packets with smaller back off window after the collision, which can seize the channel faster, but also will not cause nodes back off value is too large [11] .…”

Section: The Send Window Adjustmentmentioning

confidence: 99%

Hybrid handshake MAC protocol based on priority

Cui¹,

Xue²,

Li³

et al. 2014

Proceedings of the International Conference on Logistics, Engineering, Management and Computer Science

View full text Add to dashboard Cite

Abstract-Aiming system of mobile phone the inner-flow competition problem, based on the research of IEEE 802.11 DCF protocol mixed handshake provide priority to network coding of continuous forward MAC protocol is proposed, providing access to a higher priority encoding condition data and ensuring the node delay controllable low priority, improve the real-time performance of the system. At the same time with the NS2 network simulation software to mixed into intra flow contention problem based on holding mobile phone system MAC protocol and the traditional competitive flow within the 802.11 MAC protocol simulation, And send the packet success rate and average delay requirement of service to end delay and the average network throughput are analyzed and compared, the intra flow contention problem based on introducing hybrid holding mobile phone system MAC protocol makes the network transmission increases, average end-to-end delay decreases the success rate, Improves network average throughput， optimize the network performance，To provide a guarantee for the real-time performance of the whole network system.

show abstract

“…In [21], it was shown that any network coding problem can be reduced to an index coding problem and that a network coding problem admits a linear solution if and only if a linear index code of a specific length (determined by the network coding problem) exists for the corresponding index coding problem. This relationship was extended to include nonlinear codes in [22].…”

Section: Introductionmentioning

confidence: 99%

A Relation Between Network Computation and Functional Index Coding Problems

Gupta

Rajan

2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the source messages. Similarly, in the functional index coding problem, the side information and demands of the clients include disjoint sets of functions of the information messages held by the transmitter instead of disjoint subsets of the messages, as is the case in the conventional index coding problem. It is known that any network coding problem can be transformed into an index coding problem and vice versa. In this work, we establish a similar relationship between network computation problems and a class of functional index coding problems, viz., those in which only the demands of the clients include functions of messages. We show that any network computation problem can be converted into a functional index coding problem wherein some clients demand functions of messages and vice versa. We prove that a solution for a network computation problem exists if and only if a functional index code (of a specific length determined by the network computation problem) for a suitably constructed functional index coding problem exists. And, that a functional index coding problem admits a solution of a specified length if and only if a suitably constructed network computation problem admits a solution.

show abstract

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

Cited by 279 publications

References 29 publications

Polar codes for broadcast channels

Polar codes for broadcast channels

Hybrid handshake MAC protocol based on priority

A Relation Between Network Computation and Functional Index Coding Problems

Contact Info

Product

Resources

About