Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for <i>k</i>-th Order Markov Sources-Reference-Cited by-同舟云学术

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

Published:2014 Issue:8 Volume:E97.A Page:1754-1760
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

IWATA Ken-ichi¹,ARIMURA Mitsuharu²,SHIMA Yuki¹

Affiliation:

1. Department of Information Science, Graduate School of Engineering, University of Fukui

2. Department of Applied Computer Sciences, Shonan Institute of Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E97.A/8/E97.A_1754/_pdf

Reference21 articles.

1. [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. [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. [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. [4] M. Burrows and D.J. Wheeler, “A block-sorting lossless data compression algorithm,” Digital SRC Research Report, Tech. Rep. 124, 1994.

5. [5] J.G. Cleary and W.J. Teahan, “Unbounded length contexts for PPM,” The Computer Journal, vol.40, pp.52-61, 1997.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compression by Substring Enumeration and Its Related Topics: As a Bridge Between Offline Universal Codes;IEICE ESS Fundamentals Review;2018-07-01

2. Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2016

3. Efficient Implementation and Empirical Evaluation of Compression by Substring Enumeration;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2016