pith. sign in

Title resolution pending

· 1949

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.IT 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Pareto-type finite-block optimality for source codes: a constrained Markov example

cs.IT · 2026-05-05 · unverdicted · novelty 6.0

For a four-symbol constrained Markov source, a shortlex-ordered injective code achieves expected block length exactly 1.5 for single symbols and strictly less than 1.5n for n>=2 with an additional -c/sqrt(n) improvement, proving the Dalai-Leonardi code is not Pareto-optimal under finite-block length

citing papers explorer

Showing 1 of 1 citing paper.

  • Pareto-type finite-block optimality for source codes: a constrained Markov example cs.IT · 2026-05-05 · unverdicted · none · ref 5

    For a four-symbol constrained Markov source, a shortlex-ordered injective code achieves expected block length exactly 1.5 for single symbols and strictly less than 1.5n for n>=2 with an additional -c/sqrt(n) improvement, proving the Dalai-Leonardi code is not Pareto-optimal under finite-block length