2014/08/19 by Tyll Krueger, Guido Montufar, Krueger, Tyll +5
Computer Science · Mathematics · #68P30 #E.4 #FOS: Computer and information sciences #I.4.2 #Information Theory (cs.IT) #acm:68P30 #cs.IT #math.IT #msc:68P30
paper · pdf · doi:10.48550/arxiv.1408.4433
9 pages, 4 figures, 3 algorithms
arxiv created 2014/08/19 · arxiv updated 2014/08/20
We define an algorithm that parses multidimensional arrays sequentially into mainly unrepeated but nested multidimensional sub-arrays of increasing size, and show that the resulting sub-block pointer encoder compresses almost every realization of any finite-alphabet ergodic process on ℤ≥0d to the entropy, in the limit.