Bit Allocation and Encoding for Vector Sources

IEEE Transactions on Information Theory

Volumn 22, Issue 2, 1976, Pages 162-169

  Segall, Adrian ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - DIGITAL SIGNALS;

CODES, SYMBOLIC;

EID: 0016931516     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1976.1055533     Document Type: Article

References (12)

1. J. J. Y. Huang and P. M. Schultheiss, ‘Block quantization of correlated Gaussian random variables,” IEEE Trans. Commun. Syst., vol. CS-11, pp. 289–296, Sept. 1963.
2. D. G. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
3. R. G. Gallager Information Theory and Reliable Communication. New York: Wiley. 1968.
4. T. Berger, Rate-Distortion Theory, A Mathematical Basis for Data Compression. New York: Prentice-Hall, 1971.
5. B. S. Tsybakov, “ε-entropy of a vector message,” presented at the 1969 IEEE Int. Symp, Information Theory, Elenville, N.Y., Jan. 1969.
6. J. Max, “Quantizing for minimum distortion,” IRE Trans. Inform. Theory, vol. IT-6, pp. 7–12, Mar. 1960.
7. R. C. Wood, “On optimum quantization,” IEEE Trans. Inform, Theory, vol. IT-15, pp. 248–252, Mar. 1969.
8. D. A. Huffman “A method for the construction of minimum-redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, Sept. 1952
9. T. Cover, “Enumerative source encoding,” IEEE Trans. Inform. Theory, vol. IT-19, PP.73–77, Jan. 1973.
10. F. R. Gantmacher, Matrix Theory, vol. I, Chelsea, 1960.
11. M. Athans, “Gradient matrices and matrix calculations,” M.I.T. Lincoln Lab., Lexington, Tech. Note 1965–53, Nov. 1965.
12. B. Fox, “Discrete optimization via marginal analysis,” Management Sci., vol. 13, pp. 210–216, Nov. 1966.