Results 221 to 230 of about 11,062 (250)

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

An Efficient Implementation of Adaptive Prefix Coding

2007 Data Compression Conference (DCC'07), 2007
The goal of the prefix coding is to assign codewords to elements of the input alphabet A, so that no codeword is a prefix of another one, and the total length of the encoded message S is minimized. In the case of static prefix coding, symbol frequencies are known in advance. In the case of adaptive (or dynamic) prefix coding, every symbol Si is encoded
openaire   +1 more source

A correspondence on strongly prefix codes (Corresp.)

IEEE Transactions on Information Theory, 1975
We introduce an elementary family of prefix codes, which is closely related to many other families of prefix codes.
openaire   +1 more source

On the Maximum Size of a Prefix Code

IEEE Transactions on Information Theory, 2023
Viliam Hromada, Peter Horak, Otokar Grosek   +2 more
exaly  

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word

Theoretical Computer Science, 2020
Joe Sawada, Rajeev Raman, Zsuzsanna Lipták   +2 more
exaly  

On some properties of weakly prefix codes

1984
In this paper simplifying properties of weakly prefix codes are discussed. The notion of weakly prefix codes maximal with respect to the weakly prefix condition is introduced. It is thus proven that for nondense codes this notion is equivalent to the classical notion of maximality. Some other auxiliary results are also presented.
CAPOCELLI, Renato, SESSA, Maria Immacolata   +1 more
openaire   +2 more sources

Prefix-Free Code Distribution Matching for Probabilistic Constellation Shaping

IEEE Transactions on Communications, 2020
Junho Cho
exaly  

A family of codes commutatively equivalent to prefix codes

Information Processing Letters, 1981
S. Mauceri, Antonio Restivo
openaire   +2 more sources

Scalable code clone detection and search based on adaptive prefix filtering

Journal of Systems and Software, 2018
Kostadin Damevski
exaly