Mustafa Ergen

Zipf's Law of Abbreviation in a Logographic Script: Coding-Theoretic Bounds on Chinese Character Stroke Counts

Treating the mid-twentieth-century simplification reform as a controlled compression event, this work finds it raised optimality from 0.555 to 0.668, with savings concentrated in the 1,000 commonest characters.