Generating binary trees by transpositions
Journal of Algorithms
Information-theoretic incompleteness
Applied Mathematics and Computation
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Bananas in space: extending fold and unfold to exponential types
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Science of Computer Programming - Special issue on mathematics of program construction
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
On Simple Goedel Numberings and Translations
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Reversible Variable Length Codes for Efficient and Robust Image and Video Coding
DCC '98 Proceedings of the Conference on Data Compression
There and back again: arrows for invertible programming
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell
Proceedings of the 2009 ACM symposium on Applied Computing
On Minimum-Redundancy Fix-Free Codes
DCC '09 Proceedings of the 2009 Data Compression Conference
A Groupoid of Isomorphic Data Transformations
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
| Hi-index | 0.00 |
Using a bijection between natural numbers and hereditarily finite functions we derive a new reversible variable length self-delimiting code through a bitstring representation in a balanced parenthesis language. The code features the ability to encode arbitrarily nested data types, can represent huge (low "complexity") numbers, and is decodable from its beginning or its end. Besides its possible practical applications to media stream encodings, a comparison with the well-known Elias omega code and a conjecture about its asymptotic behavior under the Kraft inequality suggest it as an interesting object of study for experimental mathematicians. The paper is organized as a self-contained literate Haskell program inviting the reader to explore its content independently. Its code is available at http://logic.cse.unt.edu/tarau/research/2010/selfdelim.hs