Art

J-GLOBAL ID：201402246928555004   Reference number：14A0957526

Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources

k次マルコフ情報源のためのサブストリング列挙によるデータ圧縮の最大冗長性の評価

Author (3)： IWATA Ken-ichi (Dep. of Information Sci., Graduate School of Engineering, Univ. of Fukui) ,  ARIMURA Mitsuharu (Dep. of Applied Computer Sciences, Shonan Inst. of Technol.) ,  SHIMA Yuki (Dep. of Information Sci., Graduate School of Engineering, Univ. of Fukui)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web)  (IEICE Trans Fundam Electron Commun Comput Sci (Web))
Volume： E97.A  Issue： 8  Page： 1754-1760 (J-STAGE)  Publication year： 2014 
JST Material Number： U0466A  ISSN： 1745-1337  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *Data Compression ,  source coding ,  *redundancy (property) ,  *Markov process ,  limit ,  variable length code ,  upper bound ,  lossless compression
Semi thesaurus term： *Markov process

JST classification (1)： Code theory  (ND02030R)

Reference (21)：

• [1] D. Dubé and V. Beaudoin, “Lossless data compression via substring enumeration,” Proc. 2010 Data Compression Conference, DCC2010, pp.229-238, Snowbird, Utah, USA, March 2010.
• [2] D. Dubé, “Using synchronization bits to boost compression by substring enumeration,” 2010 Int. Symp. Information Theory and Appl., ISITA2010, pp.82-87, Taichung, Taiwan, Oct. 2010.
• [3] D. Dubé, “On the use of stronger synchronization to boost compression by substring enumeration,” Proc. 2011 Data Compression Conference, DCC2011, p. 454, Snowbird, Utah, USA, March 2011.
• [4] M. Burrows and D.J. Wheeler, “A block-sorting lossless data compression algorithm,” Digital SRC Research Report, Tech. Rep. 124, 1994.
• [5] J.G. Cleary and W.J. Teahan, “Unbounded length contexts for PPM,” The Computer Journal, vol.40, pp.52-61, 1997.

Terms in the title (5)： 情報源 ,  サブ ,  データ圧縮 ,  冗長性 ,  評価