• DocumentCode
    610131
  • Title

    Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm

  • Author

    Yoshida, Sigeru ; Kida, T.

  • Author_Institution
    Grad. Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo, Japan
  • fYear
    2013
  • fDate
    20-22 March 2013
  • Firstpage
    532
  • Lastpage
    532
  • Abstract
    Summary form only given. We address the problem of improving variable-length-to-fixed-length codes (VF codes). A VF code is an encoding scheme that uses a fixed-length code, and thus, one can easily access the compressed data. However, conventional VF codes usually have an inferior compression ratio to that of variable-length codes. Although a method proposed by T. Uemura et al. in 2010 achieves a good compression ratio comparable to that of gzip, it is very time consuming. In this study, we propose a new VF coding method that applies a fixed-length code to the set of rules extracted by the Re-Pair algorithm, proposed by N. J. Larsson and A. Moffat in 1999. The Re-Pair algorithm is a simple off-line grammar-based compression method that has good compression-ratio performance with moderate compression speed. Moreover, we present several experimental results to show that the proposed coding is superior to the existing VF coding.
  • Keywords
    data compression; variable length codes; VF codes; VF coding method; compression-ratio performance; effective variable-length-to-fixed-length coding; off-line grammar-based compression method; repair algorithm; Compression algorithms; Data compression; Educational institutions; Encoding; Information science; Pattern matching; Workstations; Grammar-based compression; Re-Pair algorithm; VF code;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Compression Conference (DCC), 2013
  • Conference_Location
    Snowbird, UT
  • ISSN
    1068-0314
  • Print_ISBN
    978-1-4673-6037-1
  • Type

    conf

  • DOI
    10.1109/DCC.2013.111
  • Filename
    6543142