Compression by Substring Enumeration Using Sorted Contingency Tables-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Compression by Substring Enumeration Using Sorted Contingency Tables

Published:2020-06-01 Issue:6 Volume:E103.A Page:829-835
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

OTA Takahiro¹,MORITA Hiroyoshi²,MANADA Akiko³

Affiliation:

1. School of Network and Information, Senshu University

2. Dept. of Computer and Network Engineering, Graduate School of Informatics and Engineering, The University of Electro-Communications

3. Dept. of Information Science, 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/E103.A/6/E103.A_2019EAP1063/_pdf

Reference15 articles.

1. [1] D. Dubé and V. Beaudoin, “Lossless data compression via substring enumeration,” Proc. Data Compression Conference 2010, pp.229-238, March 2010. 10.1109/DCC.2010.28

2. [2] M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, “Data compression using antidictionaries,” Proc. IEEE, vol.88, no.11, pp.1756-1768, Nov. 2000. 10.1109/5.892711

3. [3] T. Ota and H. Morita, “On the adaptive antidictionary code using minimal forbidden words with constant lengths,” Proc. International Symposium on Information Theory and its Applications, pp.72-77, Oct. 2010. 10.1109/isita.2010.5649621

4. [4] M. Béliveau and D. Dubé, “Improving compression via substring enumeration by explicit phase awareness,” Proc. Data Compression Conference 2014, pp.26-28, March 2014. 10.1109/dcc.2014.68

5. [5] H. Yokoo, “Asymptotic optimal lossless compression via the CSE technique,” Proc. Data Compression, Communications and Processing, pp.11-18, June 2011. 10.1109/ccp.2011.32

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

1. A Reconstruction of Circular Binary String Using Substrings and Minimal Absent Words;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3