Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,790,759 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.
2013
2013
Partial actions and automata
M. Dokuchaev
,
B. Novikov
,
G. Zholtkevych
arXiv.org
2013
Corpus ID: 13902962
We use the notion of a partial action of a monoid to introduce a generalization of automata, which we call "a preautomaton". We…
Expand
2012
2012
High Speed and Low Power Design of Parallel Prefix Adder
B. Krishna
,
P. Rao
,
N. Prasad
2012
Corpus ID: 55141418
Parallel-prefix adders (also known as carry-tree adders) are known to have the best performance in VLSI designs compared to that…
Expand
2007
2007
Reserved-length prefix coding
M. Baer
IEEE International Symposium on Information…
2007
Corpus ID: 14269652
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to…
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
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
Theory of Deterministic Trace-Assertion Specications ?
J. Brzozowski
,
H. Jürgensen
2004
Corpus ID: 5249184
A software module is an abstraction of a program: it has a well dened functionality, operations by which the environment ac…
Expand
2003
2003
Hybrid prefix codes for practical use
M. Liddell
,
Alistair Moffat
Data Compression Conference, . Proceedings. DCC
2003
Corpus ID: 43465366
Prefix-free codes continue to enjoy widespread use in compression systems due to their simple structure and their ease of…
Expand
1999
1999
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes
R. Milidiú
,
A. Pessoa
,
E. Laber
Workshop on Algorithm Engineering and…
1999
Corpus ID: 13390588
Given an alphabet Σ = {a1, ..., an} with a corresponding list of positive weights {w1, ..., wn} and a length restriction L, the…
Expand
1975
1975
A correspondence on strongly prefix codes (Corresp.)
J. Lassez
IEEE Transactions on Information Theory
1975
Corpus ID: 19399394
We introduce an elementary family of prefix codes, which is closely related to many other families of prefix codes.
1970
1970
Quasi-questionnaires, codes and Huffman's length
C. Picard
Kybernetika (Praha)
1970
Corpus ID: 18113628
New concepts are defined, in particular the quasi-question or vertex with an outgoing arc of zero probability. A quasi…
Expand