2 citations · 4 across the 3 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2019
Run-Length Encoding in a Finite Universe
N. Jesper Larsson
Text compression schemes and compact data structures usually combine sophisticated probability models with basic coding methods whose average codeword length closely match the entr…
cs.IT2014★ 1 cited
Integer Set Compression and Statistical Modeling
N. Jesper Larsson
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploi…