메뉴 건너뛰기




Volumn 1, Issue 1, 2010, Pages 3-12

Using information theory to study efficiency and capacity of computers and similar devices

Author keywords

Channel capacity; Computer capacity; Computer efficiency; Information theory; Shannon entropy

Indexed keywords

INFORMATION THEORY;

EID: 84862835004     PISSN: None     EISSN: 20782489     Source Type: Journal    
DOI: 10.3390/info1010003     Document Type: Article
Times cited : (4)

References (14)
  • 2
    • 0001902056 scopus 로고
    • Three approaches to the quantitative definition of information
    • Kolmogorov, A.N. Three approaches to the quantitative definition of information. Probl. Inform. Transm. 1965, 1, 3–11.
    • (1965) Probl. Inform. Transm , vol.1 , pp. 3-11
    • Kolmogorov, A.N.1
  • 4
    • 70349272811 scopus 로고    scopus 로고
    • MMIX: A RISC Computer for the New Millennium
    • Addison-Wesley: New York, NY, USA, Fascicle 1
    • Knuth, D.E. MMIX: A RISC Computer for the New Millennium. In The Art of Computer Programming; Addison-Wesley: New York, NY, USA, 2005; Volume 1, Fascicle 1.
    • (2005) The Art of Computer Programming , vol.1
    • Knuth, D.E.1
  • 5
    • 84940644968 scopus 로고
    • A mathematical theory of communication
    • 623–656
    • Shannon, C.E. A mathematical theory of communication. Bell Sys. Tech. J. 1948, 27, 379–423, 623–656.
    • (1948) Bell Sys. Tech. J , vol.27 , pp. 379-423
    • Shannon, C.E.1
  • 8
    • 0001796943 scopus 로고
    • Simple proofs of some theorems on noiseless channels
    • Csiszár, I. Simple proofs of some theorems on noiseless channels. Inform. Contr. 1969, 14, 285–298.
    • (1969) Inform. Contr , vol.14 , pp. 285-298
    • Csiszár, I.1
  • 9
    • 57249108036 scopus 로고    scopus 로고
    • Dimension extractors and optimal decompression
    • Doty, D. Dimension extractors and optimal decompression. Theory Comput. Syst. 2008, 43, 425–463.
    • (2008) Theory Comput. Syst , vol.43 , pp. 425-463
    • Doty, D.1
  • 12
    • 0022741249 scopus 로고
    • Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
    • Ryabko, B.Ya. Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity. Prob. Inform. Transm. 1986, 22, 170-179.
    • (1986) Prob. Inform. Transm , vol.22 , pp. 170-179
    • Ryabko, B.Ya.1
  • 13
    • 0003657593 scopus 로고
    • Fundamental Algorithms
    • Addison-Wesley: New York, NY, USA
    • Knuth, D.E. Fundamental Algorithms. In The Art of Computer Programming; Addison-Wesley: New York, NY, USA, 1968; Volume 1.
    • (1968) The Art of Computer Programming , vol.1
    • Knuth, D.E.1


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