메뉴 건너뛰기




Volumn 21, Issue 2, 1975, Pages 194-203

Universal Codeword Sets and Representations of the Integers

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EID: 0016486577     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1975.1055349     Document Type: Article
Times cited : (945)

References (17)
  • 1
    • 0015681549 scopus 로고
    • Universal noiseless coding
    • Nov.
    • L. D. Davisson, “Universal noiseless coding,” IEEE Trans. Inform. Theory. vol. IT-19. pp. 783–795. Nov. 1973.
    • (1973) IEEE Trans. Inform. Theory. , vol.IT-19 , pp. 783-795
    • Davisson, L.D.1
  • 2
    • 84937999311 scopus 로고
    • Predictive coding:
    • esp. pp. 30–33, Mar
    • P. Elias, “Predictive coding:” IRE Trans. Inform. Theory, vol. IT-I, pp. 16–33, esp. pp. 30–33, Mar, 1955.
    • (1955) IRE Trans. Inform. Theory , vol.IT-1 , pp. 16-33
    • Elias, P.1
  • 3
    • 0012578418 scopus 로고
    • The efficient construction of an unbiased random sequence
    • P. Elias, “The efficient construction of an unbiased random sequence,” Ann. Math. Statist., vol. 43, pp. 865–870, 1972.
    • (1972) Ann. Math. Statist. , vol.43 , pp. 865-870
    • Elias, P.1
  • 4
    • 0016047467 scopus 로고
    • Efficient storage and retrieval by content and address of static files
    • P. Elias, “Efficient storage and retrieval by content and address of static files,” J. Ass. Comput. Mach., vol. 21, pp. 246–260, 1974.
    • (1974) J. Ass. Comput. Mach. , vol.21 , pp. 246-260
    • Elias, P.1
  • 5
    • 0016114802 scopus 로고
    • Minimum times and memories needed to compute the values of a function
    • Oct.
    • P. Elias, “Minimum times and memories needed to compute the values of a function,” J. Comput. Syst. Sci., Oct. 1974.
    • (1974) J. Comput. Syst. Sci.
    • Elias, P.1
  • 6
    • 84939035489 scopus 로고
    • Computer updating of a data structure
    • July 15
    • R. A. Flower, “Computer updating of a data structure,” Research Lab. Electron., M.I.T., Cambridge, Mass., Quart. Progress Rep. 110, pp. 147-154., July 15, 1973.
    • (1973) Research Lab. Electron. , pp. 147-154
    • Flower, R.A.1
  • 7
    • 0002616515 scopus 로고
    • Permuting information in idealized two-level storage
    • Miller, Thatcher and Bohlinger, Eds. New York: Plenum
    • R. W. Floyd, “Permuting information in idealized two-level storage,” in Complexity of Computer Computations, Miller, Thatcher and Bohlinger, Eds. New York: Plenum, 1972, pp. 105-109.
    • (1972) Complexity of Computer Computations , pp. 105-109
    • Floyd, R.W.1
  • 9
    • 49849109565 scopus 로고
    • A class of probability distributions on the integers
    • S. W. Golomb, “A class of probability distributions on the integers,” J. Number Theory, vol. 2, pp. 189–192, 1970.
    • (1970) J. Number Theory , vol.2 , pp. 189-192
    • Golomb, S.W.1
  • 13
    • 0004290881 scopus 로고
    • Cambridge, Mass.: M.I.T. Press, esp.
    • M. Minsky and S. Papert, Perceptrons. Cambridge, Mass.: M.I.T. Press, 1969, esp. pp. 215–226.
    • (1969) Perceptrons , pp. 215-226
    • Minsky, M.1    Papert, S.2
  • 15
    • 84939068736 scopus 로고
    • Bounds on information retrieval efficiency in static file structures
    • Cambridge, Mass., MAC TR-88, Project MAC
    • T. Welch, “Bounds on information retrieval efficiency in static file structures,” M.I.T., Cambridge, Mass., MAC TR-88, Project MAC, 1971.
    • (1971) M.I.T.
    • Welch, T.1
  • 16
    • 0000375002 scopus 로고
    • An upper bound on the entropy series
    • A. D. Wyner, “An upper bound on the entropy series,” Inform. Contr., vol. 20, pp. 176–181, 1972.
    • (1972) Inform. Contr. , vol.20 , pp. 176-181
    • Wyner, A.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.