Upper bound on the capacity of constrained three-dimensional codes

Søren Forchhammer

doi:10.1109/ISIT.2000.866580

Upper bound on the capacity of constrained three-dimensional codes

Søren Forchhammer

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

349 Downloads (Pure)

Abstract

An upper bound on the capacity of constrained three-dimensional codes is presented. The bound for two-dimensional codes of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, no.1, p.54-60, 1998) was extended to three dimensions by Nagy and Zeger. Both bounds apply to first order symmetric constraints. The bound in three dimensions is generalized in a weaker form to higher order and non-symmetric constraints.

Original language	English
Title of host publication	IEEE International Symposium on Information Theory, 2000. Proceedings.
Number of pages	282
Publisher	IEEE
Publication date	2000
ISBN (Print)	0-7803-5857-0
DOIs	https://doi.org/10.1109/ISIT.2000.866580
Publication status	Published - 2000
Event	2000 IEEE International Symposium on Information Theory - Sorrento, Italy Duration: 25 Jun 2000 → 30 Jun 2000 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6966

Conference

Conference	2000 IEEE International Symposium on Information Theory
Country/Territory	Italy
City	Sorrento
Period	25/06/2000 → 30/06/2000
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6966

Bibliographical note

Copyright 2000 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.2000.866580

ForchhammerFinal published version, 117 KB

OpenUrl availability

Full text

Cite this

@inproceedings{7a063b67e5834463928959c6611e8f9d,

title = "Upper bound on the capacity of constrained three-dimensional codes",

abstract = "An upper bound on the capacity of constrained three-dimensional codes is presented. The bound for two-dimensional codes of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, no.1, p.54-60, 1998) was extended to three dimensions by Nagy and Zeger. Both bounds apply to first order symmetric constraints. The bound in three dimensions is generalized in a weaker form to higher order and non-symmetric constraints.",

author = "S{\o}ren Forchhammer",

note = "Copyright 2000 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.; 2000 IEEE International Symposium on Information Theory, ISIT 2000 ; Conference date: 25-06-2000 Through 30-06-2000",

year = "2000",

doi = "10.1109/ISIT.2000.866580",

language = "English",

isbn = "0-7803-5857-0",

booktitle = "IEEE International Symposium on Information Theory, 2000. Proceedings.",

publisher = "IEEE",

address = "United States",

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

}

TY - GEN

T1 - Upper bound on the capacity of constrained three-dimensional codes

AU - Forchhammer, Søren

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

Y1 - 2000

N2 - An upper bound on the capacity of constrained three-dimensional codes is presented. The bound for two-dimensional codes of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, no.1, p.54-60, 1998) was extended to three dimensions by Nagy and Zeger. Both bounds apply to first order symmetric constraints. The bound in three dimensions is generalized in a weaker form to higher order and non-symmetric constraints.

AB - An upper bound on the capacity of constrained three-dimensional codes is presented. The bound for two-dimensional codes of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, no.1, p.54-60, 1998) was extended to three dimensions by Nagy and Zeger. Both bounds apply to first order symmetric constraints. The bound in three dimensions is generalized in a weaker form to higher order and non-symmetric constraints.

U2 - 10.1109/ISIT.2000.866580

DO - 10.1109/ISIT.2000.866580

M3 - Article in proceedings

SN - 0-7803-5857-0

BT - IEEE International Symposium on Information Theory, 2000. Proceedings.

PB - IEEE

T2 - 2000 IEEE International Symposium on Information Theory

Y2 - 25 June 2000 through 30 June 2000

ER -

Upper bound on the capacity of constrained three-dimensional codes

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this