Upper bound on the capacity of constrained three-dimensional codes

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

224 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 languageEnglish
Title of host publicationIEEE International Symposium on Information Theory, 2000. Proceedings.
Number of pages282
PublisherIEEE
Publication date2000
ISBN (Print)0-7803-5857-0
DOIs
Publication statusPublished - 2000
Event2000 IEEE International Symposium on Information Theory - Sorrento, Italy
Duration: 25 Jun 200030 Jun 2000
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6966

Conference

Conference2000 IEEE International Symposium on Information Theory
CountryItaly
CitySorrento
Period25/06/200030/06/2000
Internet address

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.

Cite this