Universal codes of the natural numbers
A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how to construct effectively a code better than a given sequ...
Main Author: | Yuval Filmus |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2013-08-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/975/pdf |
Similar Items
-
Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited
by: Friedrich Neurauter, et al.
Published: (2014-09-01) -
On the Compositionality of Quantitative Information Flow
by: Yusuke Kawamoto, et al.
Published: (2017-08-01) -
Randomness extraction and asymptotic Hamming distance
by: Cameron E. Freer, et al.
Published: (2013-09-01) -
Problems in number theory from busy beaver competition
by: Pascal Michel
Published: (2015-12-01) -
Computing with Infinite Objects: the Gray Code Case
by: Dieter Spreen, et al.
Published: (2023-07-01)