Cascading Constrained 2-D Arrays using Periodic Merging Arrays

Søren Forchhammer, Torben Vaarby Laursen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

305 Downloads (Pure)

Abstract

We consider a method for designing 2-D constrained codes by cascading finite width arrays using predefined finite width periodic merging arrays. This provides a constructive lower bound on the capacity of the 2-D constrained code. Examples include symmetric RLL and density constrained codes. Numerical results for the capacities are presented.
Original languageEnglish
Title of host publicationInternational Symposium on Information Theory 2003
Number of pages109
Place of PublicationYokohama, Japan
PublisherIEEE
Publication date2003
ISBN (Print)0-7803-7728-1
DOIs
Publication statusPublished - 2003
EventInternational Symposium on Information Theory 2003 - Yokohama, Japan
Duration: 29 Jun 20034 Jul 2003
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8703

Conference

ConferenceInternational Symposium on Information Theory 2003
CountryJapan
CityYokohama
Period29/06/200304/07/2003
Internet address

Bibliographical note

Copyright: 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Cite this

Forchhammer, S., & Laursen, T. V. (2003). Cascading Constrained 2-D Arrays using Periodic Merging Arrays. In International Symposium on Information Theory 2003 IEEE. https://doi.org/10.1109/ISIT.2003.1228123