<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-22T12:12:31Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/80996" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/80996</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Blahut, Richard E.</dc:contributor>
          <dc:creator>Kiyavash, Negar</dc:creator>
          <dc:date>2015-09-25T20:09:09Z</dc:date>
          <dc:date>2015-09-25T20:09:09Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2006</dc:date>
          <dc:date>2006</dc:date>
          <dc:description>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.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:09:09Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3250272.pdf: 2846058 bytes, checksum: efac740f2d385c95b79d5050f4ef0749 (MD5)
  Previous issue date: 2006</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82278
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>133 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/80996</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3250272</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:title>Information Theoretic Limits for Secure Multimedia and Magnetic Recording</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical and Computer Engineering</department>
            <discipline>Electrical and Computer Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
