Answers are grounded in this paper and cite their sources.
Discrete-time source coding theorems are established for more general reproduction alphabets than allowed in previous results on coding for a class of sources subject to a fidelity constraint. The two different alphabets considered are metric spaces for which every closed bounded subset is compact and separable Hilbert spaces. Potential applications of the Hilbert space results to continuous-time source coding are discussed.
No takes yet. Share an insight, caveat, or question.
Pursley et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: