“…To summarize, for the two different partitions, (3) and (4), of the alphabet Σ = {a, b, c, d}, Examples 7 and 8 present respective (capacity-achieving) parity-preserving variable-length encoders with a coding ratio of 1: the first encoder is deterministic, while the other is not. In fact, we show in [17] that for the partition (4), one cannot achieve a coding ratio of 1 by any deterministic parity-preserving variable-length encoder (unless one uses a degenerate base tag alphabet containing only even symbols).…”