Expand description
Shuffle-based complexity measures.
Functions§
- lz76_
paired_ shuffle_ complexity lz76PairedShuffleComplexity— shuffle on the merged (Z) sequence.- lz76_
random_ shuffle_ complexity lz76RandomShuffleComplexity— full pipeline.- lz76_
random_ shuffle_ complexity_ with - Same, but with an already-computed original-sequence complexity (so callers
that already have it — e.g. the
lz76driver — skip one factorization). - max_
block_ size - Estimate the “naive M” satisfying
N = M * 2^M, mirroringmax_block_sizein C++. - merge_
sequences - Mirror of
internal::MergeSequences— element-wise pairing into a new alphabet. - shuffle_
entropy_ calculation - Effective measure complexity via the block-entropy estimator.
- shuffle_
factorization - Compute the random-shuffle factorization vector and
mm. MirrorsShuffleFactorizationfrom the C++.