Cascading Constrained 2-D Arrays using Periodic Merging Arrays

Søren Forchhammer; Torben Vaarby Laursen

doi:10.1109/ISIT.2003.1228123

Cascading Constrained 2-D Arrays using Periodic Merging Arrays

Søren Forchhammer
, Torben Vaarby Laursen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

520 Downloads (Orbit)

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 language	English
Title of host publication	International Symposium on Information Theory 2003
Number of pages	109
Place of Publication	Yokohama, Japan
Publisher	IEEE
Publication date	2003
ISBN (Print)	0-7803-7728-1
DOIs	https://doi.org/10.1109/ISIT.2003.1228123
Publication status	Published - 2003
Event	International Symposium on Information Theory 2003 - Yokohama, Japan Duration: 29 Jun 2003 → 4 Jul 2003 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8703

Conference

Conference	International Symposium on Information Theory 2003
Country/Territory	Japan
City	Yokohama
Period	29/06/2003 → 04/07/2003
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8703

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

Access to Document

10.1109/ISIT.2003.1228123

ForchhammerFinal published version, 121 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{b3d9566719184c0c86758aa387cef14a,

title = "Cascading Constrained 2-D Arrays using Periodic Merging Arrays",

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.",

author = "S{\o}ren Forchhammer and Laursen, \{Torben Vaarby\}",

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; International Symposium on Information Theory 2003, ISIT 2003 ; Conference date: 29-06-2003 Through 04-07-2003",

year = "2003",

doi = "10.1109/ISIT.2003.1228123",

language = "English",

isbn = "0-7803-7728-1",

booktitle = "International Symposium on Information Theory 2003",

publisher = "IEEE",

address = "United States",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8703",

}

TY - GEN

T1 - Cascading Constrained 2-D Arrays using Periodic Merging Arrays

AU - Forchhammer, Søren

AU - Laursen, Torben Vaarby

N1 - 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

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2003.1228123

DO - 10.1109/ISIT.2003.1228123

M3 - Article in proceedings

SN - 0-7803-7728-1

BT - International Symposium on Information Theory 2003

PB - IEEE

CY - Yokohama, Japan

T2 - International Symposium on Information Theory 2003

Y2 - 29 June 2003 through 4 July 2003

ER -

Cascading Constrained 2-D Arrays using Periodic Merging Arrays

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this