• DocumentCode
    3384453
  • Title

    Experimental study of a binary block sorting compression scheme

  • Author

    Nagy, Daniel A. ; Linder, Tamás

  • Author_Institution
    Dept. of Math. & Stat., Queen´´s Univ., Kingston, Ont., Canada
  • fYear
    2003
  • fDate
    25-27 March 2003
  • Firstpage
    439
  • Abstract
    Summary form only given. An experiment was conducted to evaluate a block-sorting compression scheme that operates at the bit level. The experiment demonstrated that even such a simple technique, which ignores byte boundaries and uses a very simple modeling scheme for the output of the block-sorting transform, outperforms some of the best industry standard compressors for sources that are not byte-aligned, while providing reasonable compression ratios for byte-aligned sources. Although the scheme can be substantially improved using more sophisticated modeling and coding techniques, preliminary experimental results point out the potential advantages of this approach.
  • Keywords
    Huffman codes; binary codes; block codes; sorting; source coding; binary block sorting compression scheme; bit level operation; block sorting transform; byte aligned sources; byte boundaries; compression algorithms; compression ratios; experimental evaluation; Data compression; Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Compression Conference, 2003. Proceedings. DCC 2003
  • ISSN
    1068-0314
  • Print_ISBN
    0-7695-1896-6
  • Type

    conf

  • DOI
    10.1109/DCC.2003.1194058
  • Filename
    1194058