Universal Codes for Integers |
|
Lloyd Allison, Arun S. Konagurthu & Daniel F. Schmidt, 'On universal codes for integers: Wallace Tree, Elias Omega and beyond', Data Compression Conference (DCC), pp.313-322, 22-26 March 2021 [doi:10.1109/DCC50243.2021.00039].Above: CW:=enc(N) then check that dec(CW)=N, for each of several codes – Fibonacci, Elias's omega, our omega2 and omega*, and Wallace Tree Code – all for integers ≥0 or ≥1. Note, treat the timings with great caution as who knows when javascript's garbage collector kicks in. Above: Code-word lengths for powers of 10.
Above: Code-word lengths, early points of change of the lead.
Above: Cummulative probabilities upto code-word length w (bits). Above: Experiment with robustness;
Ns→code-words→code-string→mutate(CW[0])→decode. |
|
↑ © L. Allison, www.allisons.org/ll/ (or as otherwise indicated). Created with "vi (Linux)", charset=iso-8859-1, fetched Thursday, 25-Apr-2024 02:07:05 UTC. Free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop, Firefox web-browser, FlashBlock flash on/off. |