# Prefix code

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Mathematical Structures in Computer Science
- 2009

We study computably enumerable (c.e.) prefix codes that are capable of coding all positive integers in an optimal way up to aâ€¦Â (More)

Is this relevant?

2003

2003

- ITCC
- 2003

As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes moreâ€¦Â (More)

Is this relevant?

2001

2001

- 2001

Abstract. We consider an alphabet Î£= {a 1 ,\ldots,a n } with corresponding symbol probabilities p 1 ,\ldots,p n . For each prefixâ€¦Â (More)

Is this relevant?

1999

1999

- IEEE Communications Letters
- 1999

A new general scheme is introduced that allows bidirectional decoding of variable length coded bitstreams from either end. Exceptâ€¦Â (More)

Is this relevant?

1997

1997

- IEEE Trans. Information Theory
- 1997

A straightforward application of Theorem 2 shows that all these codes are proper. ACKNOWLEDGMENT The authors wish to thank theâ€¦Â (More)

Is this relevant?

1995

1995

- 1995

Some generalizations of the usual operations of catenation and quotient of languages are introduced and studied. In particularâ€¦Â (More)

Is this relevant?

1987

1987

- SIGA
- 1987

In this paper, we show that an optimal prefix code (Huffman-equivalent code) over Σ = {0,1,...,σ} for any <i>n</iâ€¦Â (More)

Is this relevant?

1975

1975

- J. ACM
- 1975

ABSTRACrr. An algorithm for constructing an optimal prefix code of n eqmprobable words over r unequal cost coding letters isâ€¦Â (More)

Is this relevant?

1967

1967

- Information and Control
- 1967

Let X* be the free monoid generated by ~ fixed finite alphabet X of k > 1 elements. A non-empty subset A of X X * is a prefixâ€¦Â (More)

Is this relevant?

1964

1964

- Information and Control
- 1964

Let F be the free monoid generated by the set ("alphabet") X; F consists of its neutral element 1 (the so-called "empty wordâ€¦Â (More)

Is this relevant?