The Performance of Universal Encoding

IEEE Transactions on Information Theory

Volumn 27, Issue 2, 1981, Pages 199-207

  Krichevsky, Raphail E ^a   Trofimov, Victor K ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (51)

1. V. F. Babkin, “A method of universal coding with non-exponent labour consumption,” Probl. Inform. Trans., vol. 7, no. 4, pp. 13–21, 1971.
2. ― “A universal encoding of discrete sources with a countable alphabet,” Quest. Cybern., no. 34, pp. 3–10, Moscow, 1977.
3. V. F. Babkin and A. B. Krukov, “The enumeration of sequences with Markovian restrictions,” in Proc. 5th Conf. Inform. Theory, Moscow-Gorkii, pp. 15–20, 1972.
4. V. F. Babkin and Y. M. Starkov, “The enumeration of sequences with a fixed number of transitions,” in The Coding in the Complex Systems. Moscow, 1974, pp. 175–180.
5. V. D. Goppa, “Universal decoding for symmetric channels,” Probl. Inform. Trans., vol. II, no. 1, pp. 15–22, 1975.
6. ― “Nonprobabilistic mutual information without the memory,” Probl. Inform. Contr., vol. 4, no. 2, pp. 97–103, 1975.
7. A. N. Kolmogorov, “Three approaches to the definition of the notion ‘the quantity of information’,” Probl. Inform. Trans., vol. 1, no. 1, pp. 3–11, 1965.
8. R. E. Krichevskii, “The block length necessary to obtain a given redundancy,” Soy. Math. Dokl., vol. 7, no. 6, pp. 1416–1419, 1966.
9. ― “The connection between the redundancy and reliability of information about the source,” Probl. Inform. Trans., vol. 4, no. 3, pp. 48–57, 1 9 68. -
10. ― Lectures on information theory. Novosibirsk State Univ., Novosibirsk, 1970.
11. ― “The complexity of enumerating of a finite set of words,” Sou. Math. Dokl., vol. 17, no. 3, pp. 700–703, 1976.
12. ― “Optimal source-coding based on observation,” Probl. In-form. Trans., vol. 11, no. 1, pp. 37–42, 1975.
13. R. E. ICrichevskii and V. K. Trofimov, “Optimal coding of unknown and inaccurately known sources,” Topics Inform. Theory, Proc. Coll. Math. Soc. I., pp. 425–430, Bolyai, Kesztlaely, Hungary, 1975.
14. V. I. Levenstein, “The redundancy and deceleration of a separative encoding of natural numbers,” Probl. Cybern., no. 20, pp. 173–179, MOSCQW, 1968.
15. V. I. Mudrov, “An algorithm to enumerate combinations,” Vyc. Math. and Math. Phys., vol. 5, no. 4, pp. 776–778, 1965.
16. A. A. Mogulskii and V. K. Trofimov, “The Wald identity and the encoding's cost for Markovian chains,” in Proc. - VII Conference on Inform. Theory, Moscow-Vilnus, 1978, pp. 112–117.
17. I. P. Natanson, Constructive theory of functions. Moscow - Leningrad, 1949. -
18. B. J. Rjabko, “Encoding of a source with unknown but ordered probabilities,” in Proc. VII Symp. Probl. Redundancy, pt. I, Leningrad, 1977, pp. 162–164.
19. V. M. Sydelnikov, “Statistical properties of transformations by a finite automation,” Kybern., Kiev, no. 6, pp. 1–14, 1965.
20. V. K. Trofimov, “The redundancy of Markov source encoding,” Probl. of Inform. Trans., vol. 10, no. 4, pp. 16–24, 1974.
21. ― “The redundancy of universal VB-encoding of Bernoulli sources,” in Proc. III Conf. Theoretic. Cybern., Novosibirsk, 1974, pp. 152–154.
22. ― “Universal VB-encoding of Bernoulli sources,” Diskret. anal., , no. 29, pp. 87–101, Novosibirsk, 1976.
23. V. K. Trofimov and L. S. Khasin, “A method of universal optimal r encoding,” Automter., no. 3, pp. 105–107, 1978, Novosibirsk.
24. B. M. Fitingof, “Optimal encoding for unknown and changing statistics Of messages,” Probl. Inform. Trans., vol. 2, no. 2, pp. 3–11, 1966.
25. ― “The compression of discrete information,” Probl. Inform. Trans., vol. 3, no. 3, pp. 28–36, 1967.
26. ― “Universal methods of information compression by means of coding blocks of different lengths into blocks of equal lengths, in Proc. Int. Symp. Member-States COMECON, Theor. Found. of Information, VINITI, Moscow, 1970, pp. 1–24.
27. G. L. Khodak, “The connection between the redundancy and the delay for VB-encoding,” in Proc. III Conf. Theoret. Cybern., Novosibirsk, 1969, pp. 79–80.
28. ― “The estimation of redundancy for coding the messages generated by a Bernoulli source,” Probl. Inform. Trans., vol. 8, no. 2, pp. 28–32, 1 9 72. ‘
29. ― “Coding of Markov sources with low redundancy,” in Proc. 2nd Int. Symp. Inform. Theory, Tsahkadzor, Acad. Kiado, Budapest, 1973, pp. 201–209.
30. ―― “The cost of transmission of sequences,” Probl. Inform. Contr., vol. 4, no. 4, pp. 299–311, 1975.
31. I. Csizar, “On noiseless channels,” Probl. Inform. Trans., vol. 1, no. 4, pp. 3–15, 1970.
32. Yu. M. Starkov, “The coding of finite messages on output of a source with unknown statistic,” in Proc. V Conf. Inform. Theory, Moscow-Gorkii, 1972, pp. 147–152.
33. Yu. M. Starkov and V. F. Babkin, “Combinatorial encoding for discrete stationary sources,” in Proc. 2nd Int. Symp. Inform. Theory, Tsahkadzor, Armenia, USSR, 1971; Academia Kiado, Budapest, 249–257, 1973.
34. T. M. Cover, “Admissibility properties of Gilbert's encoding for unknown source probabilities. IEEE Trans. Inform. Theory, vol. 18, no. 1, pp. 216–217, 1 9 72.
35. T. M. Cover, “Enumerative sources encoding,” IEEE Trans. Inform. Theory, vol. 1–19, no. 1, pp. 73–77, 1973.
36. L. D. Davisson, “Comments on ‘Sequence time coding for data compression,” Proc. IEEE, vol. 54, p. 2010, Dec. 1966.
37. L. D. Davisson, “Universal noiseless coding,” IEEE Trans. Inform. Theory, vol. 19, no. 6, pp. 783–795 1973.
38. P. Elias, “Universal codeword sets and representations of the integers,” IEEE Trans. Inform. Theory, vol. 21, no. 2, pp. 194–203, 1975.
39. R. M. Fano, Transmission of Information. Cambridge, MA: MIT Press and New York: Wiley, 1961. ‘
40. W. Feller, An Introduction to Probability Theory and its Applications, vol. 2. New York: Wiley, 1966.
41. R. M. Gray and L. D. Davisson, “Source coding theorems without the ergodic assumption,” IEEE Trans. Inform. Theory, vol. 20, no. 4, pp. 509–510, 1979.
42. R. M. Gray and L. D. Davisson, “The ergodic decomposition of stationary discrete random processes,” IEEE Trans. Inform. Theory, vol. 20, no. 5, pp. 625–636, 1974.
43. E. N. Gilbert, “Coding based on inaccurate source probabilities,” IEEE Trans. Inform. Theory, vol. 17, no. 3, pp. 104–314, 1 9 71.
44. F. Jelinek and K. Schneider, “On variable-length to block coding,” IEEE Trans. Inform. Theory, vol. 18, no. 6, pp.765-774, 1977. -
45. T. J. Lynch, “Sequence time coding for data compression,” Proc. IEEE, vol. 54, no. 10, pp. 1490–1491, 1966.
46. J. C. Lawrence, “A new universal coding scheme for coding the binary memoryless source,” IEEE Trans. Inform. Theory, vol. 23, no. 4, pp. 446–472, 1971.
47. B. McMillan, “Two inequalities implied by unique decipherability,” IRE Trans. Inform. Theory, vol.2, no. 4, pp. 115–116, 1956.
48. D. L. Neuhoff, R. M. Gray, and L. D. Davisson, “Fixed rate universal block source coding with fidelity criterion,” IEEE Trans. Inform. Theory, vol. 21, no. 5, pp. 511–513, 1975.
49. C. E. Shannon, “Mathematical theory of communication,” Bell Syst. ! Tech. J., vol. 27, no. 3, pp. 379–423, pp. 623–656, 1978.
50. J. Ziv, “Coding of sources with unknown statistics-Part 1: Probability of encoding error,” IEEE Trans. Inform. Theo, vol. 18, no. 3, pp. 384–389, 1972.
51. ― “Coding of sources with unknown statistics-part II: Distortion relative to fidelity criterion,” IEEE Trans. Inform. Theory, vol. 18, no. 3, pp. 389–394, 1972.