메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1-191

Variable-length codes for data compression

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84887901493     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-84628-959-0     Document Type: Book
Times cited : (85)

References (105)
  • 1
    • 84887937459 scopus 로고
    • Enhancing LZW coding using a variable-length binary encoding
    • Institute for Systems Research, University of Maryland
    • Acharya, Tinku and Joseph F. JáJá (1995) "Enhancing LZW Coding Using a Variable-Length Binary Encoding", Tech Report TR 1995-70, Institute for Systems Research, University of Maryland.
    • (1995) Tech Report TR 1995-70
    • Acharya, T.1    JáJa, J.F.2
  • 2
    • 0030271162 scopus 로고    scopus 로고
    • An on-line variable length binary encoding of text
    • Acharya, Tinku and Joseph F. JáJá (1996) "An On-Line Variable Length Binary Encoding of Text", Information and Computer Science, 94:1-22.
    • (1996) Information and Computer Science , vol.94 , pp. 1-22
    • Acharya, T.1    JáJa, J.F.2
  • 4
    • 84887967371 scopus 로고    scopus 로고
    • amu (2006) is http://ifa.amu.edu.pl/∼kprzemek.
    • (2006)
  • 5
    • 22044441103 scopus 로고    scopus 로고
    • Inverted index compression using word-aligned binary codes
    • Anh, Vo Ngoc and Alistair Moffat (2005) "Inverted Index Compression Using Word-Aligned Binary Codes", Information Retrieval, 8:151-166.
    • (2005) Information Retrieval , vol.8 , pp. 151-166
    • Anh, V.N.1    Moffat, A.2
  • 6
    • 0023313890 scopus 로고
    • Robust transmission of unbounded strings using fibonacci representations
    • March
    • Apostolico, Alberto and A. S. Fraenkel (1987) "Robust Transmission of Unbounded Strings Using Fibonacci Representations", IEEE Transactions on Information Theory, 33(2):238-245, March.
    • (1987) IEEE Transactions on Information Theory , vol.33 , Issue.2 , pp. 238-245
    • Apostolico, A.1    Fraenkel, A.S.2
  • 7
    • 0034996638 scopus 로고    scopus 로고
    • On variable-length codes for iterative source/channel-decoding
    • 2001, Snowbird, UT
    • Bauer, Rainer and Joachim Hagenauer (2001) "On Variable-Length Codes for Iterative Source/Channel-Decoding", Proceedings of the IEEE Data Compression Conference, 2001, Snowbird, UT, pp. 273-282.
    • (2001) Proceedings of the IEEE Data Compression Conference , pp. 273-282
    • Bauer, R.1    Hagenauer, J.2
  • 9
    • 0002187292 scopus 로고
    • An almost optimal algorithm for unbounded searching
    • Bentley, J. L. and A. C. Yao (1976) "An Almost Optimal Algorithm for Unbounded Searching", Information Processing Letters, 5(3):82-87.
    • (1976) Information Processing Letters , vol.5 , Issue.3 , pp. 82-87
    • Bentley, J.L.1    Yao, A.C.2
  • 10
    • 84887066853 scopus 로고
    • New York, Penguin Books
    • Bass, Thomas A. (1992) Eudaemonic Pie, New York, Penguin Books.
    • (1992) Eudaemonic Pie
    • Bass, T.A.1
  • 11
    • 0025521932 scopus 로고
    • Optimum'1'-ended binary prefix codes
    • November
    • Berger, T. and R. Yeung (1990) "Optimum'1'-Ended Binary Prefix Codes", IEEE Transactions on Information Theory, 36(6):1435-1441, November.
    • (1990) IEEE Transactions on Information Theory , vol.36 , Issue.6 , pp. 1435-1441
    • Berger, T.1    Yeung, R.2
  • 14
    • 2642581914 scopus 로고    scopus 로고
    • The webgraph framework II: Codes for the world-wide web
    • DCC 2004
    • Boldi, Paolo and Sebastiano Vigna (2004b), "The WebGraph Framework II: Codes for the World-Wide Web", in Data Compression Conference, DCC 2004.
    • (2004) Data Compression Conference
    • Boldi, P.1    Vigna, S.2
  • 15
    • 84924216371 scopus 로고    scopus 로고
    • Codes for the world-wide web
    • Boldi, Paolo and Sebastiano Vigna (2005), "Codes for the World-Wide Web", Internet Mathematics, 2(4):405-427.
    • (2005) Internet Mathematics , vol.2 , Issue.4 , pp. 405-427
    • Boldi, P.1    Vigna, S.2
  • 17
    • 0041619492 scopus 로고
    • Also published in Computing, 50(4):279-296, 1993
    • (1993) Computing , vol.50 , Issue.4 , pp. 279-296
  • 21
    • 0004923192 scopus 로고
    • A maximum a-posteriori (MAP) decoding algorithm for variable-length error-correcting codes
    • Essex, England, Institute of Mathematics and Its Applications
    • Buttigieg, Victor and P. G. Farrell (1995b) "A Maximum A-Posteriori (MAP) Decoding Algorithm For Variable-Length Error-Correcting Codes", Codes and Cyphers: Cryptography and Coding IV, Essex, England, Institute of Mathematics and Its Applications, pp. 103-119.
    • (1995) Codes and Cyphers: Cryptography and Coding IV , pp. 103-119
    • Buttigieg, V.1    Farrell, P.G.2
  • 22
    • 34250877566 scopus 로고
    • Comments and additions to 'robust transmission of unbounded strings using fibonacci representations'
    • January
    • Capocelli, Renato (1989) "Comments and Additions to 'Robust Transmission of Unbounded Strings Using Fibonacci Representations'", IEEE Transactions on Information Theory, 35(1):191-193, January.
    • (1989) IEEE Transactions on Information Theory , vol.35 , Issue.1 , pp. 191-193
    • Capocelli, R.1
  • 23
    • 0026835225 scopus 로고
    • On the construction of statistically synchronizable codes
    • March
    • Capocelli, R. and A. De Santis (1992) "On The Construction of Statistically Synchronizable Codes", IEEE Transactions on Information Theory, 38(2):407-414, March.
    • (1992) IEEE Transactions on Information Theory , vol.38 , Issue.2 , pp. 407-414
    • Capocelli, R.1    De Santis, A.2
  • 25
    • 84918358658 scopus 로고
    • On the lengths of programs for computing finite binary sequences
    • October
    • Chaitin, Gregory J. (1966) "On the Lengths of Programs for Computing Finite Binary Sequences", Journal of the ACM, 13(4):547-569, October.
    • (1966) Journal of the ACM , vol.13 , Issue.4 , pp. 547-569
    • Chaitin, G.J.1
  • 27
    • 84887978064 scopus 로고    scopus 로고
    • codethatword (2007) is http://www.codethatword.com/.
    • (2007)
  • 28
    • 84887884510 scopus 로고    scopus 로고
    • dartmouth (2006) is http://www.math.dartmouth.edu/&tild;euler/ correspondence/letters/OO0765.pdf.
    • (2006)
  • 29
    • 84938156629 scopus 로고
    • Comments on 'sequence time coding for data compression'
    • 2010, December
    • Davisson, I. D. (1966) "Comments on 'Sequence Time Coding for Data Compression'", Proceedings of the IEEE, 54:2010, December.
    • (1966) Proceedings of the IEEE , vol.54
    • Davisson, I.D.1
  • 30
    • 0016486577 scopus 로고
    • Universal codeword sets and representations of the integers
    • March
    • Elias, P. (1975) "Universal Codeword Sets and Representations of the Integers", IEEE Transactions on Information Theory, 21(2):194-203, March.
    • (1975) IEEE Transactions on Information Theory , vol.21 , Issue.2 , pp. 194-203
    • Elias, P.1
  • 31
    • 84976736897 scopus 로고
    • Economical encoding of commas between strings
    • April
    • Even, S. and M. Rodeh (1978) "Economical Encoding of Commas Between Strings", Communications of the ACM, 21(4):315-317, April.
    • (1978) Communications of the ACM , vol.21 , Issue.4 , pp. 315-317
    • Even, S.1    Rodeh, M.2
  • 32
    • 0004184518 scopus 로고
    • Research Laboratory for Electronics, MIT, Tech Rep. No. 65
    • Fano, R. M. (1949) "The Transmission of Information", Research Laboratory for Electronics, MIT, Tech Rep. No. 65.
    • (1949) The Transmission of Information
    • Fano, R.M.1
  • 33
    • 0003645897 scopus 로고    scopus 로고
    • Punctured elias codes for variable-length coding of the integers
    • University of Auckland, December
    • Fenwick, Peter (1996) "Punctured Elias Codes for Variable-Length Coding of the Integers", Technical Report 137, Department of Computer Science, University of Auckland, December. This is also available online at www.firstpr.com.au/audiocomp/lossless/TechRep137.pdf.
    • (1996) Technical Report 137, Department of Computer Science
    • Fenwick, P.1
  • 34
    • 0036671369 scopus 로고    scopus 로고
    • Variable-length integer codes based on the goldbach conjecture, and other additive codes
    • August
    • Fenwick, P. (2002), "Variable-Length Integer Codes Based on the Goldbach Conjecture, and Other Additive Codes", IEEE Transactions on Information Theory, 48(8):2412-2417, August.
    • (2002) IEEE Transactions on Information Theory , vol.48 , Issue.8 , pp. 2412-2417
    • Fenwick, P.1
  • 36
    • 0024640034 scopus 로고
    • Data compression with finite windows
    • Fiala, E. R. and D. H. Greene (1989), "Data Compression with Finite Windows", Communications of the ACM, 32(4):490-505.
    • (1989) Communications of the ACM , vol.32 , Issue.4 , pp. 490-505
    • Fiala, E.R.1    Greene, D.H.2
  • 37
    • 84887895608 scopus 로고    scopus 로고
    • firstpr (2006) is http://www.firstpr.com.au/audiocomp/lossless/rice.
    • (2006)
  • 38
    • 79951492153 scopus 로고
    • Robust universal complete codes as alternatives to huffman codes
    • Dept. of Applied Mathematics, Weizmann Institute of Science, October
    • Fraenkel, A. S. and Shmuel T. Klein (1985) "Robust Universal Complete Codes as Alternatives to Huffman Codes", Tech. Report CS85-16, Dept. of Applied Mathematics, Weizmann Institute of Science, October.
    • (1985) Tech. Report CS85-16
    • Fraenkel, A.S.1    Klein, S.T.2
  • 39
    • 0025476865 scopus 로고
    • Bidirectional huffman coding
    • Fraenkel, Aviezri S. and Shmuel T. Klein (1990) "Bidirectional Huffman Coding", The Computer Journal, 33:296-307.
    • (1990) The Computer Journal , vol.33 , pp. 296-307
    • Fraenkel, A.S.1    Klein, S.T.2
  • 40
    • 0001915743 scopus 로고    scopus 로고
    • Robust universal complete codes for transmission and compression
    • January
    • Fraenkel, Aviezri S. and Shmuel T. Klein (1996) "Robust Universal Complete Codes for Transmission and Compression", Discrete Applied Mathematics, 64(1):31-55, January.
    • (1996) Discrete Applied Mathematics , vol.64 , Issue.1 , pp. 31-55
    • Fraenkel, A.S.1    Klein, S.T.2
  • 42
    • 2642561136 scopus 로고
    • Divergence and the construction of variable-to-variable-length lossless codes by source-word extensions
    • DCC'93
    • Freeman, G. H. (1993) "Divergence and the Construction of Variable-to-Variable-Length Lossless Codes by Source-Word Extensions", Proceedings of the Data Compression Conference (DCC'93), pp. 79-88.
    • (1993) Proceedings of the Data Compression Conference , pp. 79-88
    • Freeman, G.H.1
  • 43
    • 0018032133 scopus 로고
    • Variations on a Theme by Huffman
    • November
    • Gallager, Robert G. (1978) "Variations on a Theme by Huffman", IEEE Transactions on Information Theory, 24(6):668-674, November.
    • (1978) IEEE Transactions on Information Theory , vol.24 , Issue.6 , pp. 668-674
    • Gallager, R.G.1
  • 44
    • 0016485796 scopus 로고
    • Optimal source codes for geometrically distributed integer alphabets
    • March
    • Gallager, Robert G., and David C. Van Voorhis (1975) "Optimal Source Codes for Geometrically Distributed Integer Alphabets", IEEE Transactions on Information Theory, 21(3):228-230, March.
    • (1975) IEEE Transactions on Information Theory , vol.21 , Issue.3 , pp. 228-230
    • Gallager, R.G.1    Van Voorhis, D.C.2
  • 45
    • 84887932367 scopus 로고    scopus 로고
    • Gemstar (2006) is http://www.gemstartvguide.com.
    • (2006)
  • 47
    • 0033364844 scopus 로고    scopus 로고
    • Bidirectionally decodable streams of prefix code-words
    • August
    • Girod, Bernd (1999) "Bidirectionally Decodable Streams of Prefix Code-Words", IEEE Communications Letters, 3(8):245-247, August.
    • (1999) IEEE Communications Letters , vol.3 , Issue.8 , pp. 245-247
    • Girod, B.1
  • 50
    • 2942663025 scopus 로고
    • The autobiography of leonardo pisano
    • February
    • Grimm, R. E. (1973) "The Autobiography of Leonardo Pisano", Fibonacci Quarterly, 11(1):99-104, February.
    • (1973) Fibonacci Quarterly , vol.11 , Issue.1 , pp. 99-104
    • Grimm, R.E.1
  • 51
  • 54
    • 84938015047 scopus 로고
    • A method for the construction of minimum redundancy codes
    • Huffman, David (1952) "A Method for the Construction of Minimum Redundancy Codes", Proceedings of the IRE, 40(9):1098-1101.
    • (1952) Proceedings of the IRE , vol.40 , Issue.9 , pp. 1098-1101
    • Huffman, D.1
  • 55
    • 0003138552 scopus 로고
    • Minimum-redundancy coding for the discrete noiseless channel
    • Karp, R. S. (1961) "Minimum-Redundancy Coding for the Discrete Noiseless Channel", Transactions of the IRE, 7:27-38.
    • (1961) Transactions of the IRE , vol.7 , pp. 27-38
    • Karp, R.S.1
  • 56
    • 70349443802 scopus 로고    scopus 로고
    • Selecting the golomb parameter in rice coding
    • November 15
    • Kiely, A. (2004) "Selecting the Golomb Parameter in Rice Coding", IPN (Interplanetary Network) Progress Report, 42-159:1-8, November 15.
    • (2004) IPN (Interplanetary Network) Progress Report , vol.42 , Issue.159 , pp. 1-8
    • Kiely, A.1
  • 58
    • 0036671019 scopus 로고    scopus 로고
    • On design of error-correcting reversible variable length codes
    • August
    • Laković, Ksenija and John Villasenor (2002) "On Design of Error-Correcting Reversible Variable Length Codes", IEEE Communications Letters, 6(8):337-339, August.
    • (2002) IEEE Communications Letters , vol.6 , Issue.8 , pp. 337-339
    • Laković, K.1    Villasenor, J.2
  • 59
    • 0041887088 scopus 로고    scopus 로고
    • An algorithm for construction of efficient fix-free codes
    • August
    • Laković, Ksenija and John Villasenor (2003) "An Algorithm for Construction of Efficient Fix-Free Codes", IEEE Communications Letters, 7(8):391-393, August.
    • (2003) IEEE Communications Letters , vol.7 , Issue.8 , pp. 391-393
    • Laković, K.1    Villasenor, J.2
  • 60
    • 0030151205 scopus 로고    scopus 로고
    • Extended synchronizing codewords for binary prefix codes
    • May
    • Lam, Wai-Man and Sanjeev R. Kulkarni (1996) "Extended Synchronizing Codewords for Binary Prefix Codes", IEEE Transactions on Information Theory, 42(3):984-987, May.
    • (1996) IEEE Transactions on Information Theory , vol.42 , Issue.3 , pp. 984-987
    • Lam, W.-M.1    Kulkarni, S.R.2
  • 61
    • 0017513841 scopus 로고
    • A new universal coding scheme for the binary memoryless source
    • July
    • Lawrence, John C. (1977) "A New Universal Coding Scheme for the Binary Memoryless Source", IEEE Transactions on Information Theory, 23(4):466-472, July.
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.4 , pp. 466-472
    • Lawrence, J.C.1
  • 62
    • 84887866750 scopus 로고    scopus 로고
    • LBE (2007) is http://in. geocities.com/iamthebiggestone/how-lbe-works. htm.
    • (2007)
  • 63
    • 84887979085 scopus 로고    scopus 로고
    • Levenstein (2006) is http://en. wikipedia.org/wiki/Levenstein-coding.
    • (2006)
  • 64
    • 0000359937 scopus 로고
    • Sequence time coding for data compression
    • October
    • Lynch, T. J. (1966) "Sequence Time Coding for Data Compression", Proceedings of the IEEE, 54:1490-1491, October.
    • (1966) Proceedings of the IEEE , vol.54 , pp. 1490-1491
    • Lynch, T.J.1
  • 65
    • 84887948490 scopus 로고
    • Goldbach's biography
    • Charles Coulston Gillispie, New York, NY, Scribner's, 14
    • Mahoney, Michael S. (1990) "Goldbach's Biography" in Charles Coulston Gillispie Dictionary of Scientific Biography, New York, NY, Scribner's, 14 vols. 1970-1990.
    • (1990) Dictionary of Scientific Biography , pp. 1970-1990
    • Mahoney, M.S.1
  • 66
    • 84868591004 scopus 로고
    • Two inequalities implied by unique decipherability
    • December
    • McMillan, Brockway (1956) "Two Inequalities Implied by Unique Decipherability", IEEE Transactions on Information Theory, 2(4):115-116, December.
    • (1956) IEEE Transactions on Information Theory , vol.2 , Issue.4 , pp. 115-116
    • McMillan, B.1
  • 67
    • 84887967109 scopus 로고    scopus 로고
    • morse-tape (2006) is http://memory.loc.gov/mss/mmorse/071/071009/0001d. jpg.
    • (2006)
  • 68
    • 84887958158 scopus 로고    scopus 로고
    • pass (2006) is http://pass.maths.org/issue2/xfile/.
    • (2006)
  • 70
    • 84887868270 scopus 로고    scopus 로고
    • PhD Thesis, University of Montreal in French
    • Pigeon, Steven (2001b) Contributions to Data Compression, PhD Thesis, University of Montreal (in French). Available from http://www.stevenpigeon.org/ Publications/publications/phd.pdf.
    • (2001) Contributions to Data Compression
    • Pigeon, S.1
  • 71
    • 84887907965 scopus 로고    scopus 로고
    • The part on taboo codes is "Taboo Codes, New Classes of Universal Codes", and is also available at www.iro.umontreal.ca/̃brassard/ SEMINAIRES/taboo.ps. A new version has been submitted to SIAM Journal of Computing.
    • Taboo Codes, New Classes of Universal Codes
  • 72
    • 2642545648 scopus 로고    scopus 로고
    • The link database: Fast access to graphs of the web
    • Compaq Systems Research Center, Palo Alto, CA
    • Randall, Keith, Raymie Stata, Rajiv Wickremesinghe, and Janet L. Wiener (2001) "The LINK Database: Fast Access to Graphs of the Web." Research Report 175, Compaq Systems Research Center, Palo Alto, CA.
    • (2001) Research Report 175
    • Randall, K.1    Stata, R.2    Wickremesinghe, R.3    Wiener, J.L.4
  • 75
    • 0004056791 scopus 로고
    • Simple lossless and near-lossless waveform compression
    • Cambridge University, December
    • Robinson, Tony (1994) "Simple Lossless and Near-Lossless Waveform Compression", Technical Report CUED/F-INFENG/TR.156, Cambridge University, December. Available at http://citeseer.nj.nec.com/robinson94shorten. html.
    • (1994) Technical Report CUED/F-INFENG/TR.156
    • Robinson, T.1
  • 76
    • 0015097870 scopus 로고
    • Construction of minimum-redundancy codes with an optimum synchronization property
    • July
    • Rudner, B. (1971) "Construction of Minimum-Redundancy Codes with an Optimum Synchronization Property", IEEE Transactions on Information Theory, 17(4):478-487, July.
    • (1971) IEEE Transactions on Information Theory , vol.17 , Issue.4 , pp. 478-487
    • Rudner, B.1
  • 77
    • 84887942135 scopus 로고
    • "So few?" asked Frost. "Many of them contained bibliographies of books I have not yet scanned." "Then those books no longer exist", said Mordel. "It is only by accident that my master succeeded in preserving as many as there are." Roger Zelazny, For a Breath I Tarry (1966)
    • (1966) For a Breath I Tarry
  • 81
    • 84887979003 scopus 로고    scopus 로고
    • seul.org (2006) is http://f-cpu.seul.org/whygee/phasing-in-codes/ PhasingInCodes.nb.
    • (2006)
  • 82
    • 84856043672 scopus 로고
    • A mathematical theory of communication
    • 623-656, July and October
    • Shannon, Claude E. (1948), "A Mathematical Theory of Communication", Bell System Technical Journal, 27:379-423 and 623-656, July and October
    • (1948) Bell System Technical Journal , vol.27 , pp. 379-423
    • Shannon, C.E.1
  • 83
    • 0023867248 scopus 로고
    • Fast decoding of the huffman codes
    • Sieminski, A. (1988) "Fast Decoding of the Huffman Codes", Information Processing Letters, 26(5):237-241.
    • (1988) Information Processing Letters , vol.26 , Issue.5 , pp. 237-241
    • Sieminski, A.1
  • 85
    • 0019058615 scopus 로고
    • Improved prefix encodings of the natural numbers
    • September
    • Stout, Quentin F. (1980) "Improved Prefix Encodings of the Natural Numbers", IEEE Transactions on Information Theory, 26(5):607-609, September.
    • (1980) IEEE Transactions on Information Theory , vol.26 , Issue.5 , pp. 607-609
    • Stout, Q.F.1
  • 86
    • 84887987158 scopus 로고    scopus 로고
    • T-REC-h (2006) is http://www.itu.int/rec/T-REC-h.
    • (2006)
  • 88
    • 0018020596 scopus 로고
    • A compression method for clustered bit-vectors
    • October
    • Teuhola, J. (1978) "A Compression Method for Clustered Bit-Vectors", Information Processing Letters, 7:308-311, October.
    • (1978) Information Processing Letters , vol.7 , pp. 308-311
    • Teuhola, J.1
  • 89
    • 0026838052 scopus 로고
    • A universal variable-to-fixed length source code based on lawrence's algorithm
    • March
    • Tjalkens, T. and Frans M. Willems (1992) "A Universal Variable-to-Fixed Length Source Code Based on Lawrence's Algorithm", IEEE Transactions on Information Theory, 38(2):247-253, March.
    • (1992) IEEE Transactions on Information Theory , vol.38 , Issue.2 , pp. 247-253
    • Tjalkens, T.1    Willems, F.M.2
  • 90
    • 0035440490 scopus 로고    scopus 로고
    • On constructing the huffman-code based reversible variable length codes
    • September
    • Tsai, C. W. and J. L. Wu (2001a) "On Constructing the Huffman-Code Based Reversible Variable Length Codes", IEEE Transactions on Communications, 49(9):1506-1509, September.
    • (2001) IEEE Transactions on Communications , vol.49 , Issue.9 , pp. 1506-1509
    • Tsai, C.W.1    Wu, J.L.2
  • 91
    • 0035443343 scopus 로고    scopus 로고
    • Modified symmetrical reversible variable-length code and its theoretical bounds
    • September
    • Tsai, Chien-Wu and Ja-Ling Wu (2001b) "Modified Symmetrical Reversible Variable-Length Code and its Theoretical Bounds", IEEE Transactions on Information Theory, 47(6):2543-2548, September.
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.6 , pp. 2543-2548
    • Tsai, C.-W.1    Wu, J.-L.2
  • 92
    • 0003480399 scopus 로고
    • PhD dissertation, Georgia Institute of Technology, Atlanta, GA, September
    • Tunstall, B. P. (1967) "Synthesis of Noiseless Compression Codes", PhD dissertation, Georgia Institute of Technology, Atlanta, GA, September.
    • (1967) Synthesis of Noiseless Compression Codes
    • Tunstall, B.P.1
  • 93
    • 84887969197 scopus 로고    scopus 로고
    • uklinux (2007) is http://www.bckelk.uklinux.net/menu.html.
    • (2007)
  • 94
    • 84887947372 scopus 로고    scopus 로고
    • 2006, is Weisstein, Eric W, From MathWorld-A Wolfram Web Resource
    • Ulam (2006) is Weisstein, Eric W. "Ulam Sequence." From MathWorld-A Wolfram Web Resource. http://mathworld.wolfram.com/UlamSequence. html.
    • Ulam Sequence
  • 95
    • 84887863965 scopus 로고    scopus 로고
    • utm (2006) is http://primes.utm.edu/notes/conjectures/.
    • (2006)
  • 96
    • 0023978375 scopus 로고
    • Almost asymptotically optimal flag encoding of the integers
    • March
    • Wang, Muzhong (1988) "Almost Asymptotically Optimal Flag Encoding of the Integers", IEEE Transactions on Information Theory, 34(2):324-326, March.
    • (1988) IEEE Transactions on Information Theory , vol.34 , Issue.2 , pp. 324-326
    • Wang, M.1
  • 97
    • 0031652254 scopus 로고    scopus 로고
    • Reversible variable length codes for efficient and robust image and video coding
    • Snowbird, UT, March-April
    • Wen, Jiangtao and John D. Villasenor (1998) "Reversible Variable Length Codes for Efficient and Robust Image and Video Coding", Data Compression Conference, pp. 471-480, Snowbird, UT, March-April.
    • (1998) Data Compression Conference , pp. 471-480
    • Wen, J.1    Villasenor, J.D.2
  • 98
    • 0033872013 scopus 로고    scopus 로고
    • A new recursive universal code of the positive integers
    • March
    • Yamamoto, Hirosuke (2000) "A New Recursive Universal Code of the Positive Integers", IEEE Transactions on Information Theory, 46(2):717-723, March.
    • (2000) IEEE Transactions on Information Theory , vol.46 , Issue.2 , pp. 717-723
    • Yamamoto, H.1
  • 99
    • 0026221018 scopus 로고
    • A new asymptotically optimal code for the positive integers
    • September
    • Yamamoto, Hirosuke and Hiroshi Ochi (1991) "A New Asymptotically Optimal Code for the Positive Integers", IEEE Transactions on Information Theory, 37(5):1420-1429, September.
    • (1991) IEEE Transactions on Information Theory , vol.37 , Issue.5 , pp. 1420-1429
    • Yamamoto, H.1    Ochi, H.2
  • 100
    • 0001460086 scopus 로고
    • Représentation des Nombres Naturels par Une Somme de Nombres de Fibonacci ou de Nombres de Lucas
    • Zeckendorf, E. (1972) "Représentation des Nombres Naturels par Une Somme de Nombres de Fibonacci ou de Nombres de Lucas", Bull. Soc. Roy. Sci. Liège, 41:179-182.
    • (1972) Bull. Soc. Roy. Sci. Liège , vol.41 , pp. 179-182
    • Zeckendorf, E.1
  • 101
    • 0001426740 scopus 로고
    • Theorems for a price: Tomorrow's semi-rigorous mathematical culture
    • October
    • Zeilberger, D. (1993) "Theorems for a Price: Tomorrow's Semi-Rigorous Mathematical Culture", Notices of the American Mathematical Society, 40(8):978-981, October.
    • (1993) Notices of the American Mathematical Society , vol.40 , Issue.8 , pp. 978-981
    • Zeilberger, D.1
  • 102
    • 0003190150 scopus 로고
    • Fall
    • Reprinted in Mathematical Intelligencer, 16(4):11-14 (Fall 1994).
    • (1994) Mathematical Intelligencer , vol.16 , Issue.4 , pp. 11-14
  • 103
    • 84887866887 scopus 로고    scopus 로고
    • Zipf's Law (2007) is http://en. wikipedia.org/wiki/Zipf's-law
    • (2007)
  • 104
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • Ziv, Jacob and A. Lempel (1977) "A Universal Algorithm for Sequential Data Compression", IEEE Transactions on Information Theory, 23(3):337-343.
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 105
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable-rate coding
    • Ziv, Jacob and A. Lempel (1978) "Compression of Individual Sequences via Variable-Rate Coding", IEEE Transactions on Information Theory, 24(5):530-536.
    • (1978) IEEE Transactions on Information Theory , vol.24 , Issue.5 , pp. 530-536
    • Ziv, J.1    Lempel, A.2


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