期待符号語長を最小にするSuffix tree上の最適文脈に基づくデータ圧縮法 (情報理論)

期待符号語長を最小にするSuffix tree上の最適文脈に基づくデータ圧縮法

(情報理論)

Journal name: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110(137) 2010.7.22・23

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

CiNii Research
Search Service
You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
Check the holdings of this book

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 記事
Title: 期待符号語長を最小にするSuffix tree上の最適文脈に基づくデータ圧縮法
Author/Editor: 友國恵太
山本博資
Series Title: 情報理論
Author Heading: 友國恵太
山本博資
Alternative Title: Data compression based on the optimal context determined by the minimal expected codeword length in a suffix tree
Periodical title: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue: 110(137) 2010.7.22・23
Volume: 110
Issue: 137
Pages: 7～12
Publication date of volume/issue (W3CDTF): 2010-07
ISSN (Periodical Title): 0913-5685
ISSN-L (Periodical Title): 0913-5685
Publication (Periodical Title): 東京 : 電子情報通信学会
Place of Publication (Country Code): JP
Text Language Code: jpn
Subject Heading: suffix tree
算術符号
データ圧縮
PPM
arithmetic coding
data compression
NDLC: ZN33
Target Audience: 一般
Report No. (Article): IT2010-12
Holding library: 国立国会図書館
Call No.: Z16-940
Data Provider (Database): 国立国会図書館 : 国立国会図書館雑誌記事索引
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 10786922
http://id.ndl.go.jp/bib/10786922
Bibliographic Record Category (NDL): 632