[BOOK][B] Information theory: coding theorems for discrete memoryless systems
I Csiszár, J Körner - 2011 - books.google.com
Csiszár and Körner's book is widely regarded as a classic in the field of information theory,
providing deep insights and expert treatment of the key theoretical issues. It includes in …
providing deep insights and expert treatment of the key theoretical issues. It includes in …
On the index coding problem and its relation to network coding and matroid theory
The index coding problem has recently attracted a significant attention from the research
community due to its theoretical significance and applications in wireless ad hoc networks …
community due to its theoretical significance and applications in wireless ad hoc networks …
Adaptive distributed source coding
We consider distributed source coding in the presence of hidden variables that parameterize
the statistical dependence among sources. We derive the Slepian-Wolf bound and devise …
the statistical dependence among sources. We derive the Slepian-Wolf bound and devise …
On the Linearization of Optimal Rates for Independent Zero-Error Source and Channel Problems
Zero-error coding encompasses a variety of source and channel problems where the
probability of error must be exactly zero. This condition is stricter than that of the vanishing …
probability of error must be exactly zero. This condition is stricter than that of the vanishing …
Zero-error network information theory: graphs, coding for computing and source-channel duality
N Charpenay - 2023 - theses.hal.science
This doctoral thesis focuses on zero-error information theory, particularly on source coding
with side information, channel coding and source-channel duality. These works revolve …
with side information, channel coding and source-channel duality. These works revolve …
Permutation capacities of families of oriented infinite paths
G Brightwell, G Cohen, E Fachini, M Fairthorne… - SIAM Journal on Discrete …, 2010 - SIAM
Körner and Malvenuto asked whether one can find n⌊n/2⌋ linear orderings (ie,
permutations) of the first n natural numbers such that any pair of them places two …
permutations) of the first n natural numbers such that any pair of them places two …
Graph capacities and zero-error transmission over compound channels
J Nayak, K Rose - IEEE transactions on information theory, 2005 - ieeexplore.ieee.org
This correspondence investigates the behavior of the compound channel under a zero-error
constraint. We derive expressions for the capacity when a) neither the encoder nor decoder …
constraint. We derive expressions for the capacity when a) neither the encoder nor decoder …
Improved source coding exponents via Witsenhausen's rate
BG Kelly, AB Wagner - IEEE transactions on information theory, 2011 - ieeexplore.ieee.org
We provide a novel upper-bound on Witsenhausen's rate, the rate required in the zero-error
analogue of the Slepian-Wolf problem. Our bound is given in terms of a new information …
analogue of the Slepian-Wolf problem. Our bound is given in terms of a new information …
On complementary graph entropy
E Tuncel, J Nayak, P Koulgi… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
It has been recently discovered that complementary graph entropy characterizes (and offers
new insights into) the minimum asymptotic rate for zero-error source coding with decoder …
new insights into) the minimum asymptotic rate for zero-error source coding with decoder …
On variable-length coding of sources with side information at multiple decoders
E Tuncel, K Rose - IEEE International Symposium on …, 2003 - ieeexplore.ieee.org
On variable-length coding of sources with side information at multiple decoders | IEEE
Conference Publication | IEEE Xplore On variable-length coding of sources with side …
Conference Publication | IEEE Xplore On variable-length coding of sources with side …