<?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-23T05:47:21Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/116250" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/116250</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>Viswanath, Pramod</dc:contributor>
          <dc:contributor>Viswanath, Pramod</dc:contributor>
          <dc:contributor>Hajek, Bruce</dc:contributor>
          <dc:contributor>Rayadurgam, Srikant</dc:contributor>
          <dc:contributor>Sun, Ruoyu</dc:contributor>
          <dc:contributor>Oh, Sewoong</dc:contributor>
          <dc:date>2022-08</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:language>en</dc:language>
          <dc:type>text</dc:type>
          <dc:description>Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms</dc:description>
          <dc:description>The student, Ashok Makkuva, accepted the attached license on 2022-07-15 at 00:05.</dc:description>
          <dc:description>The student, Ashok Makkuva, submitted this Dissertation for approval on 2022-07-15 at 00:10.</dc:description>
          <dc:description>This Dissertation was approved for publication on 2022-07-15 at 12:22.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #18327 on 2022-11-15 at 18:21:15</dc:description>
          <dc:title>Deep code: representation and learning algorithms for neural networks &amp; their applications to communication codes</dc:title>
          <dc:creator>Makkuva, Ashok Vardhan</dc:creator>
          <dc:date>2022-07-15</dc:date>
          <dc:subject>machine-learning</dc:subject>
          <dc:subject>LSTM</dc:subject>
          <dc:subject>GRU</dc:subject>
          <dc:subject>mixture-of-experts</dc:subject>
          <dc:subject>deep learning</dc:subject>
          <dc:subject>KO codes</dc:subject>
          <dc:subject>channel codes</dc:subject>
          <dc:subject>error-correcting-codes</dc:subject>
          <dc:subject>Reed-Muller codes</dc:subject>
          <dc:subject>Polar codes</dc:subject>
          <dc:description>Codes are the backbone of modern information age. Codes, composed of encoder and decoder pairs, are the basic mathematical objects that enable reliable communication. Landmark codes include convolutional, Reed-Muller, turbo, LDPC, and polar: each is linear and represents a mathematical breakthrough. Their impact on humanity is huge; each of these codes has been used in global communication standards over the past six decades.  On the other hand, designing codes is a challenging task, mostly driven by human ingenuity. Befittingly, historically, the progress in discovery of codes has been sporadic. 

In this thesis, we present a new paradigm to invent codes via harnessing tools from deep-learning. Our major result is the invention of \emph{KO codes}, a computationally efficient family of deep-learning driven codes that outperform the state-of-the-art RM and polar codes, in the challenging short-to-medium block length regime. The key technical innovation behind KO codes is the design of a novel family of neural architectures inspired by the computation tree of the {\bf K}ronecker {\bf O}peration (KO) central to RM and polar codes. These architectures pave the way for discovery of a much richer class of hitherto unexplored non-linear codes. This design technique can be viewed as an instantiation of the classical neural augmentation principle. In the process, we also study a popular neural network model called Mixture-of-Experts (MoE) that realizes this principle. We provide the first set of consistent and efficient algorithms with global learning guarantees for learning the parameters in a MoE which has been an open problem for more than two decades.</dc:description>
          <dc:type>Thesis</dc:type>
          <dc:language>eng</dc:language>
          <dc:identifier>https://hdl.handle.net/2142/116250</dc:identifier>
          <dc:rights>Copyright 2022 Ashok Makkuva</dc:rights>
          <degree>
            <name>Ph.D.</name>
            <level>Dissertation</level>
            <discipline>Electrical &amp; Computer Engr</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <department>Electrical &amp; Computer Eng</department>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
