ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(ジャーナル)
  2. Vol.52
  3. No.12

Improving Parse Trees for Efficient Variable-to-Fixed Length Codes

https://ipsj.ixsq.nii.ac.jp/records/79549
https://ipsj.ixsq.nii.ac.jp/records/79549
174e03e0-7b8a-4edc-b379-2c7a25fee235
名前 / ファイル ライセンス アクション
IPSJ-JNL5212055.pdf IPSJ-JNL5212055 (1.4 MB)
Copyright (c) 2011 by the Information Processing Society of Japan
オープンアクセス
Item type Journal(1)
公開日 2011-12-15
タイトル
タイトル Improving Parse Trees for Efficient Variable-to-Fixed Length Codes
タイトル
言語 en
タイトル Improving Parse Trees for Efficient Variable-to-Fixed Length Codes
言語
言語 eng
キーワード
主題Scheme Other
主題 特集:情報爆発時代におけるIT基盤技術
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Hokkaido University
著者所属
Hokkaido University/Presently with Yahoo Japan Corporation
著者所属
Hokkaido University
著者所属
Fujitsu Laboratories Ltd.
著者所属
Fujitsu Laboratories Ltd.
著者所属(英)
en
Hokkaido University
著者所属(英)
en
Hokkaido University / Presently with Yahoo Japan Corporation
著者所属(英)
en
Hokkaido University
著者所属(英)
en
Fujitsu Laboratories Ltd.
著者所属(英)
en
Fujitsu Laboratories Ltd.
著者名 Satoshi, Yoshida

× Satoshi, Yoshida

Satoshi, Yoshida

Search repository
Takashi, Uemura

× Takashi, Uemura

Takashi, Uemura

Search repository
Takuya, Kida

× Takuya, Kida

Takuya, Kida

Search repository
Tatsuya, Asai

× Tatsuya, Asai

Tatsuya, Asai

Search repository
Seishi, Okamoto

× Seishi, Okamoto

Seishi, Okamoto

Search repository
著者名(英) Satoshi, Yoshida

× Satoshi, Yoshida

en Satoshi, Yoshida

Search repository
Takashi, Uemura

× Takashi, Uemura

en Takashi, Uemura

Search repository
Takuya, Kida

× Takuya, Kida

en Takuya, Kida

Search repository
Tatsuya, Asai

× Tatsuya, Asai

en Tatsuya, Asai

Search repository
Seishi, Okamoto

× Seishi, Okamoto

en Seishi, Okamoto

Search repository
論文抄録
内容記述タイプ Other
内容記述 We address the problem of improving variable-length-to-fixed-length codes (VF codes). A VF code that we deal here with is an encoding scheme that parses an input text into variable length substrings and then assigns a fixed length codeword to each parsed substring. VF codes have favourable properties for fast decoding and fast compressed pattern matching, but they are worse in compression ratio than the latest compression methods. The compression ratio of a VF code depends on the parse tree used as a dictionary. To gain a better compression ratio we present several improvement methods for constructing parse trees. All of them are heuristical solutions since it is intractable to construct the optimal parse tree. We compared our methods with the previous VF codes, and showed experimentally that their compression ratios reach to the level of state-of-the-art compression methods.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.20.238
------------------------------
論文抄録(英)
内容記述タイプ Other
内容記述 We address the problem of improving variable-length-to-fixed-length codes (VF codes). A VF code that we deal here with is an encoding scheme that parses an input text into variable length substrings and then assigns a fixed length codeword to each parsed substring. VF codes have favourable properties for fast decoding and fast compressed pattern matching, but they are worse in compression ratio than the latest compression methods. The compression ratio of a VF code depends on the parse tree used as a dictionary. To gain a better compression ratio we present several improvement methods for constructing parse trees. All of them are heuristical solutions since it is intractable to construct the optimal parse tree. We compared our methods with the previous VF codes, and showed experimentally that their compression ratios reach to the level of state-of-the-art compression methods.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.20.238
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN00116647
書誌情報 情報処理学会論文誌

巻 52, 号 12, 発行日 2011-12-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7764
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-20 06:52:31.834902
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3