Results 171 to 180 of about 211 (203)

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

Prefix code translation by mapping

Journal of Computer Science and Technology, 1994
This paper introduces a new way of prefix code translation. It helps to finish the whole translation by mapping once (only one comparison instruction is needed for getting the length of prefix code), and returns the original data and the length of prefix code element.
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

Complexity of acceptors for prefix codes (Corresp.)

IEEE Transactions on Information Theory, 1976
For a given finite set of messages and their assigned probabilities, Huffman's procedure gives a method of computing a length set (a set of codeword lengths) that is optimal in the sense that the average word length is minimized. Corresponding to a particular length set, however, there may be more than one code. Let L(n) consist of all length sets with
Donna J. Brown, Peter Elias 0001
openaire   +1 more source

Hybrid prefix codes for practical use

Data Compression Conference, 2003. Proceedings. DCC 2003, 2003
Prefix-free codes continue to enjoy widespread use in compression systems due to their simple structure and their ease of decoding. Minimum-redundancy prefix codes, such as Huffman codes, are widely used. However, approximate codes also receive considerable attention.
Mike Liddell, Alistair Moffat
openaire   +1 more source