Data Compression by Context Sorting

スポンサーリンク

概要

• 論文の詳細を見る

• This paper proposes a new lossless data compression method, which utilizes a context sorting algorithm. Every symbol in the data can be predicted by taking its immediately preceding characters, or context, into account. The context sorting algorithm sorts a set of all the previous contexts to find the most similar context to the current one. It then predicts the next symbol by sorting previous symbol-context pairs in an order of context similarity. The codeword for the next symbol represents the rank of the symbol in this sorted sequence. The compression performance is evaluated both analytically and empirically. Although the proposed method operates character by character, with no probability distribution used to make a prediction, it has comparable compression performance to the best known data compression utilities.

• 社団法人電子情報通信学会の論文
• 1996-05-25

著者

• Yokoo Hidetoshi

  Department Of Computer Science Gunma University

• Yokoo Hidetoshi

  Department Of Electrical Engineering Faculty Of Engineering Yamagata University

• TAKAHASHI Masaharu

  Department of Chemistry, Hokkaido University

• Takahashi M

  Kyoto Univ. Kyoto‐shi Jpn

• Takahashi Masaharu

  Department Of Chemistry Hokkaido University

関連論文

• Modified Electron-Pair Calculation on the Ground State of the Water Molecule with Accurate Integrals
• An Efficient Representation of the Integers for the Distribution of Partial Quotients over the Continued Fractions
• Data Compression by Context Sorting

スポンサーリンク