logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Data compression using antidictionaries

delete2000-11-01
delete66
delete
OA
AI
M
Maxime Crochemore *
F
Filippo Mignosi
A
Antonio Restivo
S
Sergio Salemi
DOI：10.1109/5.892711delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We give a new text-compression scheme based on forbidden words (antidictionary). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that is produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. The techniques used in this paper are form information theory and finite automata.
Keywords:
data compression
finite automaton
forbidden word
information theory
lossless compression
pattern matching

Journal

Proceedings of the IEEE cover
Proceedings of the IEEE
IF:
25.9
Papers:
9.9K
Citations:
4.5W

Organization

No organization information available