Results 211 to 220 of about 11,062 (250)

Optimum extensions of prefix codes

Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Maximal Prefix-Synchronized Codes

SIAM Journal on Applied Mathematics, 1978
A prefix-synchronized code with prefix P of length p is a collection of strings whose first p characters equal P, but which have the property that P does not occur in any concatenation of codewords in any positions but those corresponding to initial segments of codewords.
Guibas, L. J., Odlyzko, A. M.
openaire   +2 more sources

On the implementation of minimum redundancy prefix codes

IEEE Transactions on Communications, 1997
Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of minimum redundancy coding, the majority based on the use of improved representations for explicit Huffman trees.
Alistair Moffat, Andrew Turpin
openaire   +1 more source

Binary prefix codes ending in a "1"

IEEE Transactions on Information Theory, 1994
Summary: Binary prefix codes with the constraint that each codeword must end with a ``1'' have been recently introduced by \textit{T. Berger} and \textit{R. W. Yeung} [ibid. 36, 1435-1441 (1990; Zbl 0713.94009)]. We analyze the performance of such codes by investigating their average codeword length.
Renato M. Capocelli, Alfredo De Santis, Giuseppe Persiano   +2 more
openaire   +2 more sources

Dendrograms and irreducible prefix codes

1991
Dendrograms have been used in cluster analysis and in hierarchical classification problems. In this paper we note that the Huffman method for producing optimal binary codes also produces only dendrograms.
John McAlpin, Christos Nikolopoulos
openaire   +1 more source

A Fast Algorithm for Adaptive Prefix Coding

Algorithmica, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Karpinski, Yakov Nekrich
openaire   +2 more sources

Fast prefix code processing

Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing, 2004
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal data structures which are small compared to the available main memory capacity.
openaire   +1 more source

Two Dimensional Prefix Codes of Pictures

2013
A two-dimensional code is defined as a set X ⊆ Σ** such that any picture over Σ is tilable in at most one way with pictures in X. The codicity problem is undecidable. The subclass of prefix codes is introduced and it is proved that it is decidable whether a finite set of pictures is a prefix code. Further a polynomial time decoding algorithm for finite
Anselmo, M, GIAMMARRESI, DORA, Madonia, M.   +2 more
openaire   +3 more sources

Verification of minimum-redundancy prefix codes

IEEE Transactions on Information Theory, 2006
We show that verifying a given prefix code for optimality requires /spl Omega/(nlogn) time, indicating that the verification problem is not asymptotically easier than the construction problem. Alternatively, we give linear-time verification algorithms for several special cases that are either typical in practice or theoretically interesting.
Ahmed A. Belal, Amr Elmasry
openaire   +1 more source

In-place length-restricted prefix coding

Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207), 2002
Huffman codes, combined with word-based models, are considered efficient compression schemes for full-text retrieval systems. The decoding rate for these schemes can be substantially improved if the maximum length of the codewords is not greater then the machine word size L.
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber   +2 more
openaire   +1 more source