Optimal encoding of discrete-time continuous-amplitude memoryless sources with finite output alphabets
- 1 March 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 26 (2) , 144-155
- https://doi.org/10.1109/tit.1980.1056165
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Bounds on Quantizer Performance in the Low Bit-Rate RegionIEEE Transactions on Communications, 1978
- Trellis encoding of continuous-amplitude memoryless sources (Corresp.)IEEE Transactions on Information Theory, 1977
- On tree coding with a fidelity criterionIEEE Transactions on Information Theory, 1975
- Tree encoding of Gaussian sourcesIEEE Transactions on Information Theory, 1974
- Trellis Encoding of memoryless discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Tree encoding for symmetric sources with a distortion measureIEEE Transactions on Information Theory, 1974
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- Permutation codes for sourcesIEEE Transactions on Information Theory, 1972
- Asymptotically efficient quantizingIEEE Transactions on Information Theory, 1968
- Analog source digitization: A comparison of theory and practice (Corresp.)IEEE Transactions on Information Theory, 1967