메뉴 건너뛰기




Volumn 22, Issue 3, 2008, Pages 410-417

Compression of small text files

Author keywords

Compression; Decompression; Quine McCluskey; Small files

Indexed keywords

BOOLEAN ALGEBRA; BOOLEAN FUNCTIONS; COMPRESSION RATIO (MACHINERY); DATA COMPRESSION; STANDARDS;

EID: 46749105933     PISSN: 14740346     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aei.2008.05.001     Document Type: Article
Times cited : (25)

References (25)
  • 1
    • 46749141436 scopus 로고    scopus 로고
    • G.J. Mathews, Selecting a general-purpose data compression algorithm, in: Proceedings of the Science Information Management and Data Compression Workshop, NASA Publication 3315, 1995, pp. 55-64.
    • G.J. Mathews, Selecting a general-purpose data compression algorithm, in: Proceedings of the Science Information Management and Data Compression Workshop, NASA Publication 3315, 1995, pp. 55-64.
  • 2
    • 0342521304 scopus 로고    scopus 로고
    • Compression: a key for next-generation text retrieval systems
    • Ziviani N., Moura E., Navarro G., and Baeza-Yates R. Compression: a key for next-generation text retrieval systems. IEEE Computer 33 11 (2000) 37-44
    • (2000) IEEE Computer , vol.33 , Issue.11 , pp. 37-44
    • Ziviani, N.1    Moura, E.2    Navarro, G.3    Baeza-Yates, R.4
  • 3
    • 46749127905 scopus 로고    scopus 로고
    • J. Mandal, An approach towards development of efficient data compression algorithms and correction techniques, Ph.D. dissertation, Jadavpur University, 2000.
    • J. Mandal, An approach towards development of efficient data compression algorithms and correction techniques, Ph.D. dissertation, Jadavpur University, 2000.
  • 4
    • 46749107801 scopus 로고    scopus 로고
    • M.K. Pandya, Data compression: efficiency of varied compression techniques, Technical Report, University of Brunel, UK, 2000.
    • M.K. Pandya, Data compression: efficiency of varied compression techniques, Technical Report, University of Brunel, UK, 2000.
  • 5
    • 0024680467 scopus 로고
    • Dynamic Huffman encoding
    • Vitter J.S. Dynamic Huffman encoding. Journal of the ACM 15 2 (1989) 158-167
    • (1989) Journal of the ACM , vol.15 , Issue.2 , pp. 158-167
    • Vitter, J.S.1
  • 6
    • 46749126320 scopus 로고    scopus 로고
    • D.K. Harman (Ed.), The First Retrieval Conference (TREC-1), National Institute of Standards and Technology, Gaithersburg, USA, 1993.
    • D.K. Harman (Ed.), The First Retrieval Conference (TREC-1), National Institute of Standards and Technology, Gaithersburg, USA, 1993.
  • 7
    • 46749141838 scopus 로고    scopus 로고
    • D.K. Harman (Ed.), The Second Retrieval Conference (TREC-2), National Institute of Standards and Technology, Gaithersburg, USA, 1994.
    • D.K. Harman (Ed.), The Second Retrieval Conference (TREC-2), National Institute of Standards and Technology, Gaithersburg, USA, 1994.
  • 8
    • 46749141032 scopus 로고    scopus 로고
    • D.K. Harman (Ed.), The Fourth Retrieval Conference (TREC-4), National Institute of Standards and Technology, Gaithersburg, USA, 1997.
    • D.K. Harman (Ed.), The Fourth Retrieval Conference (TREC-4), National Institute of Standards and Technology, Gaithersburg, USA, 1997.
  • 9
    • 84959015234 scopus 로고    scopus 로고
    • R.N. Horspool, G.V. Cormack, Construction word-based text compression algorithms, in: Proceedings of the 2nd IEEE Data Compression Conference. Snowbird, 1992.
    • R.N. Horspool, G.V. Cormack, Construction word-based text compression algorithms, in: Proceedings of the 2nd IEEE Data Compression Conference. Snowbird, 1992.
  • 10
    • 84938015047 scopus 로고
    • A method for the construction of minimum-redundancy codes
    • Huffman D.A. A method for the construction of minimum-redundancy codes. Proceedings of IRE 40 9 (1952) 1098-1101
    • (1952) Proceedings of IRE , vol.40 , Issue.9 , pp. 1098-1101
    • Huffman, D.A.1
  • 11
    • 65749088683 scopus 로고    scopus 로고
    • J. Lansky, M. Zemlicka, Compression of small text files using syllables, in: Data Compression Conference, vol. DCC, p. 458, 2006.
    • J. Lansky, M. Zemlicka, Compression of small text files using syllables, in: Data Compression Conference, vol. DCC, p. 458, 2006.
  • 12
    • 84958980272 scopus 로고    scopus 로고
    • Word-based compression methods and indexing for text retrieval systems
    • Springer Verlag
    • Dvorský J., Pokorný J., and Snášel V. Word-based compression methods and indexing for text retrieval systems. ADBIS' (1999), Springer Verlag 75-84
    • (1999) ADBIS' , pp. 75-84
    • Dvorský, J.1    Pokorný, J.2    Snášel, V.3
  • 13
    • 0030671788 scopus 로고    scopus 로고
    • A corpus for the evaluation of lossless compression algorithms
    • Storer J.A., and Cohn M. (Eds), IEEE Computer Society Press, Los Alamitos, California
    • Arnold R., and Bell T. A corpus for the evaluation of lossless compression algorithms. In: Storer J.A., and Cohn M. (Eds). Proceedings of the 1997 IEEE Data Compression Conference (1997), IEEE Computer Society Press, Los Alamitos, California 201-210
    • (1997) Proceedings of the 1997 IEEE Data Compression Conference , pp. 201-210
    • Arnold, R.1    Bell, T.2
  • 14
    • 0010803601 scopus 로고
    • Lzw data compression
    • Nelson M. Lzw data compression. Dr Dobb's Journal 14 10 (1989) 62-75
    • (1989) Dr Dobb's Journal , vol.14 , Issue.10 , pp. 62-75
    • Nelson, M.1
  • 16
    • 33749010902 scopus 로고    scopus 로고
    • Development and investigation of a novel compression technique using boolean minimization
    • El-Qawasmeh E., and Kattan A. Development and investigation of a novel compression technique using boolean minimization. Neural Network, World Czech Republic 4 6 (2006) 313-326
    • (2006) Neural Network, World Czech Republic , vol.4 , Issue.6 , pp. 313-326
    • El-Qawasmeh, E.1    Kattan, A.2
  • 18
    • 0021439618 scopus 로고
    • A technique for high-performance data compression
    • Welch T.A. A technique for high-performance data compression. IEEE Computer 17 6 (1984) 8-19
    • (1984) IEEE Computer , vol.17 , Issue.6 , pp. 8-19
    • Welch, T.A.1
  • 20
    • 0029779158 scopus 로고    scopus 로고
    • Simple universal lossy data compression schemes derived from the lempel-ziv algorithm
    • Yang E.-H., and Kieffer J.C. Simple universal lossy data compression schemes derived from the lempel-ziv algorithm. IEEE Transactions on Information Theory IT 42 1 (1996) 239-245
    • (1996) IEEE Transactions on Information Theory IT , vol.42 , Issue.1 , pp. 239-245
    • Yang, E.-H.1    Kieffer, J.C.2
  • 22
    • 46749122395 scopus 로고    scopus 로고
    • M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Technical report, Digital Systems Research Center Research Report 124, 1994.
    • M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Technical report, Digital Systems Research Center Research Report 124, 1994.
  • 23
    • 84858094914 scopus 로고    scopus 로고
    • J. Lansky, K. Chernik, Z. Vlickova, Comparison of Text Models for BWT, Data Compression Conference, 2007, DCC'07, March 2007, p. 389.
    • J. Lansky, K. Chernik, Z. Vlickova, Comparison of Text Models for BWT, Data Compression Conference, 2007, DCC'07, March 2007, p. 389.
  • 24
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • Ziv J., and Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23 3 (1977) 337-343
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 25
    • 46749122799 scopus 로고    scopus 로고
    • M. Mahoney, Adaptive Weighing of Context Models for Lossless Data Compression, Florida Tech. Technical Report CS-2005-16, 2005.
    • M. Mahoney, Adaptive Weighing of Context Models for Lossless Data Compression, Florida Tech. Technical Report CS-2005-16, 2005.


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