New bounds on the capacity of multi-dimensional RLL-constrained systems

Moshe Schwartz, Alexander Vardy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially a combinatorial counting problem, into a probabilistic setting, we are able to derive new lower and upper bounds on the capacity of (0, k)-RLL systems. These bounds are better than all previously-known bounds for k ≥ 2, and are even tight asymptotically. Thus, we settle the open question: what is the rate at which the capacity of (0, k)-RLL systems converges to 1 as k → ∞? While doing so, we also provide the first ever non-trivial upper bound on the capacity of general (d, k)-RLL systems.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 16th International Symposium, AAECC-16, Proceedings
Pages225-234
Number of pages10
DOIs
StatePublished - 6 Jul 2006
Externally publishedYes
Event16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16 - Las Vegas, NV, United States
Duration: 20 Feb 200624 Feb 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3857 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16
Country/TerritoryUnited States
CityLas Vegas, NV
Period20/02/0624/02/06

Fingerprint

Dive into the research topics of 'New bounds on the capacity of multi-dimensional RLL-constrained systems'. Together they form a unique fingerprint.

Cite this