Approximate enumerative coding for 2-D constraints through ratios of maprix Products
Erik Ordentlich, Ron M. Roth · 2009
We show how to improve on the technique of approximate enumerative coding for a family of two-dimensional constraints by encoding according to lower bounds based on the worst-case behavior of certain ratios of matrix products. For the case of the two-dimensional (d = 2;infin) run-length limited (RLL) constraint, the improved approach yields a lower bound of 0.4453 on the capacity of the constraint.