An algebraic and probabilistic framework for network information theory
SS Pradhan, A Padakandla… - Foundations and Trends …, 2020 - nowpublishers.com
In this monograph, we develop a mathematical framework based on asymptotically good
random structured codes, ie, codes possessing algebraic properties, for network information …
random structured codes, ie, codes possessing algebraic properties, for network information …
The case for structured random codes in network communication theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is
usually established via a two-stage approach: The sources are compressed into bits, and …
usually established via a two-stage approach: The sources are compressed into bits, and …
Compute-forward for DMCs: Simultaneous decoding of multiple combinations
Algebraic network information theory is an emerging facet of network information theory,
studying the achievable rates of random code ensembles that have algebraic structure, such …
studying the achievable rates of random code ensembles that have algebraic structure, such …
An approximation approach to network information theory
This monograph illustrates a novel approach, which is based on changing the focus to seek
approximate solutions accompanied by universal guarantees on the gap to optimality, in …
approximate solutions accompanied by universal guarantees on the gap to optimality, in …
[图书][B] Network information theory
A El Gamal, YH Kim - 2011 - books.google.com
This comprehensive treatment of network information theory and its applications provides
the first unified coverage of both classical and recent results. With an approach that …
the first unified coverage of both classical and recent results. With an approach that …
[图书][B] Information theory and network coding
RW Yeung - 2008 - books.google.com
This book is an evolution from my book A First Course in Information Theory published in
2002 when network coding was still at its infancy. The last few years have witnessed the …
2002 when network coding was still at its infancy. The last few years have witnessed the …
A unified random coding bound
In this paper, we prove a unified achievability bound that generalizes and improves random
coding bounds for any combination of source coding, channel coding, joint source-channel …
coding bounds for any combination of source coding, channel coding, joint source-channel …
A graph-based framework for transmission of correlated sources over broadcast channels
S Choi, SS Pradhan - IEEE Transactions on Information Theory, 2008 - ieeexplore.ieee.org
In this paper, we consider the communication problem that involves transmission of
correlated sources over broadcast channels. We consider a graph-based framework for this …
correlated sources over broadcast channels. We consider a graph-based framework for this …
A Lego-brick approach to coding for network communication
Coding schemes for several problems in network information theory are constructed starting
from point-to-point channel codes that are designed for symmetric channels. Given that the …
from point-to-point channel codes that are designed for symmetric channels. Given that the …
Structured random codes and sensor network coding theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is
usually established via a two-stage approach: The sources are compressed into bits, and …
usually established via a two-stage approach: The sources are compressed into bits, and …