Information Theoretic Limits for Secure Multimedia and Magnetic Recording

The second part of this thesis addresses the problem of finding the capacity of two-dimensional (1, infinity) constrained channels for a binary alphabet. The Shannon capacity of a constrained channel is generalized to a notion of soft capacity which allows violations of the constraint. By drawing an analogy with an Ising array of the same geometry, it is proven that finding the soft capacity is equivalent to finding the partition function of the Ising model. Therefore, the problem of finding the capacity of a two-dimensional (1, infinity) constrained channel is reduced to the problem of finding an eigenvalue of a matrix.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Kiyavash, Negar

Contributors dc:contributor

• Blahut, Richard E.

• Engineering, Electronics and Electrical

Language dc:language

eng

Identifier

(MiAaPQ)AAI3250272

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/80996