PivCo-Huffman adapts wavelet tree pivots to Huffman coding for SIMD-accelerated operations and optionally mixes in ANS on skewed nodes.
Interleaved entropy coders
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
The ANS family of arithmetic coders developed by Jarek Duda has the unique property that encoder and decoder are completely symmetric in the sense that a decoder reading bits will be in the exact same state that the encoder was in when writing those bits---all "buffering" of information is explicitly part of the coder state and identical between encoder and decoder. As a consequence, the output from multiple ABS/ANS coders can be interleaved into the same bitstream without any additional metadata. This allows for very efficient encoding and decoding on CPUs supporting superscalar execution or SIMD instructions, as well as GPU implementations. We also show how interleaving without additional metadata can be implemented for any entropy coder, at some increase in encoder complexity.
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Absolute-offset design enables unified position-invariant random access through entropy and match compression layers with one coordinate and bit-perfect verification.
citing papers explorer
-
PivCo-Huffman
PivCo-Huffman adapts wavelet tree pivots to Huffman coding for SIMD-accelerated operations and optionally mixes in ANS on skewed nodes.
-
Unified Position-Invariant Random Access Through Two Compression Layers via Absolute-Offset Coordinates: A Bit-Perfect Device-Resident Proof
Absolute-offset design enables unified position-invariant random access through entropy and match compression layers with one coordinate and bit-perfect verification.