DeepAI AI Chat
Log In Sign Up

On Universal Codes for Integers: Wallace Tree, Elias Omega and Variations

by   Lloyd Allison, et al.
Monash University

A universal code for the (positive) integers can be used to store or compress a sequence of integers. Every universal code implies a probability distribution on integers. This implied distribution may be a reasonable choice when the true distribution of a source of integers is unknown. Wallace Tree Code (WTC) is a universal code for integers based on binary trees. We give the encoding and decoding routines for WTC and analyse the properties of the code in comparison to two well-known codes, the Fibonacci and Elias omega codes. Some improvements on the Elias omega code are also described and examined.


page 1

page 2

page 3

page 4


General form of almost instantaneous fixed-to-variable-length codes and optimal code tree construction

A general class of the almost instantaneous fixed-to-variable-length (AI...

Encoding and Decoding of Several Optimal Rank Metric Codes

This paper presents encoding and decoding algorithms for several familie...

Gopala-Hemachandra codes revisited

Gopala-Hemachandra codes are a variation of the Fibonacci universal code...

Hypersuccinct Trees – New universal tree source codes for optimal compressed tree data structures

We present a new universal source code for unlabeled binary and ordinal ...

Structure-Unified M-Tree Coding Solver for MathWord Problem

As one of the challenging NLP tasks, designing math word problem (MWP) s...

Universal codes in the shared-randomness model for channels with general distortion capabilities

We put forth new models for universal channel coding. Unlike standard co...

A Tighter Upper Bound of the Expansion Factor for Universal Coding of Integers and Its Code Constructions

In entropy coding, universal coding of integers (UCI) is a binary univer...