Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,111,797 papers from all fields of science
Search
Sign In
Create Free Account
Prefix code
Known as:
Prefix free code
, Fixed-length code
, Prefix codes
Expand
A prefix code is a type of code system (typically a variable-length code) distinguished by its possession of the "prefix property", which requires…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Arithmetic coding
Block code
Chen–Ho encoding
Code
Expand
Broader (2)
Coding theory
Data compression
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Complement on Free and Ideal Languages
P. Mlynárcik
Workshop on Descriptional Complexity of Formal…
2015
Corpus ID: 40458565
We study nondeterministic state complexity of the complement operation on the classes of prefix-free, suffix-free, factor-free…
Expand
2012
2012
Variable length local decoding and alignment-free sequence comparison
G. Didier
,
Eduardo Corel
,
I. Laprevotte
,
A. Grossmann
,
Claudine Devauchelle
Theoretical Computer Science
2012
Corpus ID: 42043120
2009
2009
The number of rectangular islands by means of distributive lattices
G. Czédli
European journal of combinatorics (Print)
2009
Corpus ID: 33993122
2006
2006
Decoding prefix codes
M. Liddell
,
Alistair Moffat
Software, Practice & Experience
2006
Corpus ID: 18861342
Minimum‐redundancy prefix codes have been a mainstay of research and commercial compression systems since their discovery by…
Expand
2005
2005
Prefix-Free Regular-Expression Matching
Yo-Sub Han
,
Yajun Wang
,
D. Wood
Annual Symposium on Combinatorial Pattern…
2005
Corpus ID: 18478207
We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We show that the prefix-free…
Expand
2004
2004
ON INSTANTANEOUS CODES
S. Foldes
,
N. Singhi
2004
Corpus ID: 12218339
Maximal instantaneous codes are characterized by the property that they allow unique parsing of every infinite string. The…
Expand
2004
2004
Monotonicity-based fast algorithms for MAP estimation of Markov sequences over noisy channels
Xiaolin Wu
,
S. Dumitrescu
,
Zhe Wang
IEEE Transactions on Information Theory
2004
Corpus ID: 12441262
In this correspondence, we study algorithmic approach to solving the problem of maximum a posteriori (MAP) estimation of Markov…
Expand
2004
2004
Dynamic IP router-tables using highest-priority matching
Haibin Lu
,
S. Sahni
Proceedings. ISCC . Ninth International Symposium…
2004
Corpus ID: 43415544
We develop a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are…
Expand
2002
2002
Synchronization and Stability of Finite Automata
J. Kari
Journal of universal computer science (Online)
2002
Corpus ID: 12009735
Let G =( V,E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is…
Expand
1987
1987
The construction of Huffman-equivalent prefix code in NC
S. Teng
SIGA
1987
Corpus ID: 15522622
In this paper, we show that an optimal prefix code (Huffman-equivalent code) over Σ = {0,1,...,σ} for any <i>n</i…
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