Abstract:
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 w...Show MoreMetadata
Abstract:
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.
Published in: 2009 IEEE International Symposium on Information Theory
Date of Conference: 28 June 2009 - 03 July 2009
Date Added to IEEE Xplore: 18 August 2009
ISBN Information:
Contents 