Results 181 to 190 of about 211 (203)

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

Two properties of prefix codes and uniquely decodable codes

Designs, Codes, and Cryptography, 2023
Tian Kun, Zheng Zhiyong, Zhiyong Zheng   +2 more
exaly  

Characterization and measure of infinite two-dimensional strong prefix codes

Information and Computation, 2020
Dora Giammarresi, Maria Serafina Madonia   +1 more
exaly  

Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes

2022
Russell W F Lai, Hoover H F Yin
exaly  

Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes

IEEE Transactions on Information Theory, 2020
Mohammad Javad-Kalbasi, Mohammadali Khosravifard   +1 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

Optimal Prefix Free Codes with Partial Sorting

Algorithms, 2020
Jeremy Barbay
exaly  

On the construction of maximal prefix-synchronized codes

IEEE Transactions on Information Theory, 1996
A J van Wijngaarden
exaly  

Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties

Lecture Notes in Computer Science, 2017
Dora Giammarresi, Maria Serafina Madonia, Anselmo Marcella   +2 more
exaly