论文信息 - Variable-rate coding for classes of sources with generalized alphabets

Variable-rate coding for classes of sources with generalized alphabets

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.

Michael B. Pursley | Kenneth M. Mackenthun

[1] Jacob Ziv,et al. Coding of sources with unknown statistics-II: Distortion relative to a fidelity criterion , 1972, IEEE Trans. Inf. Theory.

[2] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .

[3] Victor Klee,et al. Convexity of Chebyshev sets , 1961 .

[4] Michael B. Pursley,et al. Source Coding Theorems for Stationary, Continuous-time Stochastic Processes , 1977 .

[5] Arne Bronsted. Convex Sets and Chebyshev Sets. , 1965 .

[6] David L. Neuhoff,et al. Fixed rate universal block source coding with a fidelity criterion , 1975, IEEE Trans. Inf. Theory.

[7] John C. Kieffer. On the optimum average distortion attainable by fixed-rate coding of a nonergodic source , 1975, IEEE Trans. Inf. Theory.

[8] Michael B. Pursley,et al. Variable rate coding for nonergodic sources and classes of ergodic sources subject to a fidelity constraint , 1976, IEEE Trans. Inf. Theory.

[9] Robert M. Gray,et al. Source coding theorems without the ergodic assumption , 1974, IEEE Trans. Inf. Theory.

[10] Michael B. Pursley. Coding theorems for non-ergodic sources and sources with unknown parameters (Ph.D. Thesis abstr.) , 1975, IEEE Trans. Inf. Theory.

[11] R. Phelps. Convex sets and nearest points , 1957 .