Results 161 to 170 of about 211 (203)

Partial-prefix synchronizable codes

IEEE Transactions on Information Theory, 2001
Summary: A new class of codes for frame synchronization is proposed. Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix. To avoid the occurrence of the prefix elsewhere is the frame, a Prefix Synchronizable code (PS-code) is used.
A J van Wijngaarden
exaly   +2 more sources

A family of codes commutatively equivalent to prefix codes

Information Processing Letters, 1981
A Restivo
exaly   +3 more sources

Decoding prefix codes

Software: Practice and Experience, 2006
1687
Mike Liddell, Alistair Moffat
openaire   +2 more sources

Housekeeping for prefix coding

IEEE Transactions on Communications, 2000
Summary: We consider the problem of constructing and transmitting the prelude for Huffman coding. With careful organization of the required operations and an appropriate representation for the prelude, it is possible to make semistatic coding efficient even when \(S\), the size of the source alphabet, is of the same magnitude as \(m\), the length of ...
Andrew Turpin, Alistair Moffat
openaire   +1 more source

Optimal Prefix Codes And Huffman Codes

International Journal of Computer Mathematics, 2003
Existence of the optimal prefix codes is shown in this paper. Relationship between the optimal prefix code and the Huffman code is also discussed. We prove that all Huffman codes are optimal prefix codes and conversely optimal prefix codes need not be Huffman codes.
Dongyang Long, Weijia Jia 0001, Ming Li 0002   +2 more
openaire   +1 more source

Bit Recycling with Prefix Codes

2007 Data Compression Conference (DCC'07), 2007
This paper presents a technique that aims at reducing the expansion of the compressed files that is caused by the multiplicity of equivalent messages. It does not try to eliminate multiplicity. Instead, it takes advantage of multiplicity by converting it into useful information, which we choose to describe parts of the compressed file itself.
Danny Dubé, Vincent Beaudoin
openaire   +1 more source

Strong Prefix Codes of Pictures

2013
A set X ⊆ Σ** of pictures is a code if every picture over Σ is tilable in at most one way with pictures in X. The definition of strong prefix code is introduced and it is proved that the corresponding family of finite strong prefix codes is decidable and it has a polynomial time decoding algorithm.
Anselmo, M, GIAMMARRESI, DORA, Madonia, M.   +2 more
openaire   +3 more sources

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