Bounds on the Capacity of Weakly constrained two-dimensional Codes

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

261 Downloads (Pure)

Abstract

Upper and lower bounds are presented for the capacity of weakly constrained two-dimensional codes. The maximum entropy is calculated for two simple models of 2-D codes constraining the probability of neighboring 1s as an example. For given models of the coded data, upper and lower bounds on the capacity for 2-D channel models based on occurrences of neighboring 1s are considered.
Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory, 2002. Proceedings.
Number of pages356
Place of PublicationLausanne, Switzerland
PublisherIEEE
Publication date2002
ISBN (Print)0-7803-7501-7
DOIs
Publication statusPublished - 2002
EventIEEE International Symposium on Information Theory, 2002. Proceedings. - Lausanne, Switzerland
Duration: 1 Jan 2003 → …

Conference

ConferenceIEEE International Symposium on Information Theory, 2002. Proceedings.
CityLausanne, Switzerland
Period01/01/2003 → …

Bibliographical note

Copyright: 2002 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

Fingerprint

Dive into the research topics of 'Bounds on the Capacity of Weakly constrained two-dimensional Codes'. Together they form a unique fingerprint.

Cite this