<?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-19T00:25:59Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/80983" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/80983</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>Ralf Koetter</dc:contributor>
          <dc:creator>Ratnakar, Niranjan N.</dc:creator>
          <dc:date>2015-09-25T20:09:06Z</dc:date>
          <dc:date>2015-09-25T20:09:06Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2006</dc:date>
          <dc:date>2006</dc:date>
          <dc:description>With the aim of understanding network coding in wireless scenarios, we investigate multicasting in Aref networks. These networks do not capture interference, but they do incorporate deterministic broadcasting. We characterize the multicast capacity of Aref networks, the achievability of which is shown using an ensemble of random codes. In order to construct structured capacity achieving codes, we consider a natural layered coding scheme and show that this coding scheme is suboptimal.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:09:06Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3242969.pdf: 2879236 bytes, checksum: b33e796187383a76b0ab602a6ab931dd (MD5)
  Previous issue date: 2006</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82265
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>97 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/80983</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3242969</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:title>Optimized Network Coding for Wireline and Aref Networks</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>
