Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,084,878 papers from all fields of science
Search
Sign In
Create Free Account
Dictionary coder
Known as:
Dictionary coding
, Huffword
A dictionary coder, also sometimes known as a substitution coder, is a class of lossless data compression algorithms which operate by searching for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Byte pair encoding
Circular buffer
Concordance (publishing)
Data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Dual Dictionary Compression for the Last Level Cache
Akshay Lahiry
,
D. Kaeli
ICCD
2017
Corpus ID: 40271506
The performance of GPUs is rapidly improving as the top GPU vendors keep pushing the boundaries of process technologies. While…
Expand
2015
2015
A MODIFIED COMPRESSION TECHNIQUE FOR TRACE DATA USING DICTIONARY METHOD
R.AGALYA
,
S.Saravanan
2015
Corpus ID: 212477823
–In VLSI design circuits, System-On-Chip consumes more area due to huge data volume in the hardware. In order to reduce that…
Expand
2012
2012
Automatic extraction of command hierarchies for adaptive brain-robot interfacing
M. Bryan
,
Griffin Nicoll
,
Vibinash Thomas
,
M. Chung
,
Joshua R. Smith
,
Rajesh P. N. Rao
IEEE International Conference on Robotics and…
2012
Corpus ID: 15624848
Recent advances in neuroscience and robotics have allowed initial demonstrations of brain-computer interfaces (BCIs) for…
Expand
2010
2010
Dictionary compression for a scan-based, main-memory database system
Janick Bernet
2010
Corpus ID: 59133364
The advent of the No-SQL movement and the emergence of innovative, new database technology over the last years reflect the…
Expand
2005
2005
Dictionary-based program compression on transport triggered architectures
J. Heikkinen
,
A. Cilio
,
J. Takala
,
H. Corporaal
IEEE International Symposium on Circuits and…
2005
Corpus ID: 2122732
Program code size has become a critical design constraint of embedded systems. Large program codes require large memories, which…
Expand
2005
2005
LZ trie and dictionary compression
S. Ristov
Software, Practice & Experience
2005
Corpus ID: 26564206
An efficient algorithm for trie compression has already been described. Here we present its practical value and demonstrate its…
Expand
1999
1999
Dictionary Selection Using Partial Matching
Dzung T. Hoang
,
Philip M. Long
,
J. Vitter
Information Sciences
1999
Corpus ID: 11614939
1999
1999
Word-Based Compression Methods and Indexing for Text Retrieval Systems
J. Dvorský
,
J. Pokorný
,
V. Snás̃el
Symposium on Advances in Databases and…
1999
Corpus ID: 18815905
In this article we present a new compression method, called WLZW, which is a word-based modification of classic LZW. The…
Expand
1994
1994
PRAM algorithms for static dictionary compression
L. M. Stauffer
,
D. Hirschberg
Proceedings of 8th International Parallel…
1994
Corpus ID: 22890234
Parallel algorithms for lossless data compression via dictionary compression using the longest fragment first (LFF) and greedy…
Expand
1994
1994
Parsing algorithms for dictionary compression on the PRAM
D. Hirschberg
,
L. M. Stauffer
Data Compression Conference
1994
Corpus ID: 34500356
Parallel algorithms for lossless data compression via dictionary compression using optimal and greedy parsing strategies are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE