Answers are grounded in this paper and cite their sources.
A new and simple method is proposed for finding good encoders both for channels and for sources with side information. This method relies on the continuous version of a graph decomposition result of Lovász. The presently known best exponential error bounds for both problems follow in a unified manner with an improvement on the source coding bound. The previous bounds for universal codes of the authors and Marton are also improved.
No takes yet. Share an insight, caveat, or question.
Csiszár et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: