Optimum extensions of prefix codes (original) (raw)
Related papers
Optimal prefix codes with fewer distinct codeword lengths are faster to construct
Information and Computation
Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Easier to Construct
2005
On the Maximum Size of a Prefix Code
Optimal Prefix Free Code: word-RAM Linear and Algebraic Instance Optimal
2012
Optimal Prefix Free Codes with Partial Sorting
Algorithms, 2019
A Note on the Maximum Size of a Prefix Code
IEEE Access
J an 2 01 6 Optimal Prefix Free Codes with Partial Sorting
2018
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
2006
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
1998
A combinatorial property of finite prefix codes
Information and Control, 1978
2005
Verification of minimum-redundancy prefix codes
IEEE Transactions on Information Theory, 2006
Adding Security to Prefix Codes
2004
On the construction of maximal prefix-synchronized codes
Adriaan J de Lind van Wijngaarden
IEEE Transactions on Information Theory, 1996
On the minimum distance graph of an extended Preparata code
Kevin Phelps, Cristina Fernandez-Cordoba
Designs, Codes and Cryptography, 2010
A Cipher Based on Prefix Codes
Sensors
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
Lecture Notes in Computer Science, 2016
On Some Properties of Graph of Prefix Code
Journal of applied mathematics and physics, 2024
Non prefix-free codes for constrained sequences
2005
Searching for Low Weight Codewords in Linear Binary Codes
2008
On the lattice of prefix codes
Theoretical Computer Science, 2002
Binary prefix codes ending in a "1
IEEE Transactions on Information Theory, 1994
Efficient computation of the set of codewords of minimal support
2012