Answers are grounded in this paper and cite their sources.
A modified proof of T. Berger's (1971) abstract alphabet source coding with a fidelity criterion theorem is provided, utilizing a variant of a result from large deviation theory. This proof does not use an asymptotic equipartition property of any kind, thus providing what appears to be a more direct approach to this key result.>
No takes yet. Share an insight, caveat, or question.
J.A. Bucklew (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: