ICASSP
2011
IEEE
13 years 4 months ago
2011
IEEE
We consider the decentralized Bayesian binary hypothesis testing problem in feedback architectures, in which the fusion center broadcasts information based on the messages of some...
TIT
2002
14 years 2 days ago
2002
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
TSP
2008
14 years 9 days ago
2008
We derive the Neyman
TIT
2008
14 years 10 days ago
2008
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
CORR
2007
Springer
14 years 12 days ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
CORR
2006
Springer
14 years 14 days ago
2006
Springer
-- We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. Within this framework, we apply the heuristic cavity method fro...
CORR
2006
Springer
14 years 14 days ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
CORR
2008
Springer
14 years 15 days ago
2008
Springer
Exponential error bounds for the finite
DCC
2006
IEEE
15 years 19 hour ago
2006
IEEE
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...