Establish bit-cost analogues of the logarithmic law

Investigate and establish precise bit-cost analogues of the logarithmic relation between static dictionary covering and adaptive covering under optimized pointer representations.

Background

The logarithmic law proved in the paper concerns uniform phrase count, not encoded bit length. The paper emphasizes that dictionary references and self-references can have different costs and that greedy phrase-count minimization need not minimize bit length. It therefore leaves unresolved the corresponding quantitative law for optimized pointer-based bit-cost models.