<?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-20T07:17:55Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/97446" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/97446</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>Wu, Yihong</dc:contributor>
          <dc:creator>Makkuva, Ashok Vardhan</dc:creator>
          <dc:date>2017-08-10T19:15:57Z</dc:date>
          <dc:date>2017-08-10T19:15:57Z</dc:date>
          <dc:date>2017-04-26</dc:date>
          <dc:date>2017-05</dc:date>
          <dc:description>Entropy inequalities are very important in information theory and they play a crucial role in various communication-theoretic problems, for example, in the study of the degrees of freedom of interference channels. In this thesis, we are concerned with the additive-combinatorial entropy inequalities which are motivated by their combinatorial counterparts: cardinality inequalities for subsets of abelian groups. As opposed to the existing approaches in the literature in the study of the discrete and continuous entropy inequalities, we consider a general framework of balanced linear entropy inequalities. In particular, we show a fundamental equivalence relationship between these classes of discrete and continuous entropy inequalities. In other words, we show that a balanced Shannon entropy inequality holds if and only if the corresponding differential entropy inequality holds. We also investigate these findings in a more general setting of connected abelian Lie groups and in the study of the sharp constants for entropy inequalities.</dc:description>
          <dc:description>Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-08-10 without embargo terms</dc:description>
          <dc:description>The student, Ashok Makkuva, accepted the attached license on 2017-04-24 at 13:15.</dc:description>
          <dc:description>The student, Ashok Makkuva, submitted this Thesis for approval on 2017-04-24 at 13:16.</dc:description>
          <dc:description>This Thesis was approved for publication on 2017-04-26 at 17:46.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #10999 on 2017-08-10 at 13:45:33</dc:description>
          <dc:description>Made available in DSpace on 2017-08-10T19:15:57Z (GMT). No. of bitstreams: 2
MAKKUVA-THESIS-2017.pdf: 599339 bytes, checksum: c2c6cb2ce9513dae120140237f937bf7 (MD5)
LICENSE.txt: 4210 bytes, checksum: 0820f5de79755d3e01231f3919d544ec (MD5)
  Previous issue date: 2017-04-26</dc:description>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://hdl.handle.net/2142/97446</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2017 Ashok Makkuva</dc:rights>
          <dc:subject>Shannon entropy</dc:subject>
          <dc:subject>Differential entropy</dc:subject>
          <dc:subject>Information theory</dc:subject>
          <dc:subject>Additive combinatorics</dc:subject>
          <dc:subject>Entropy inequalities</dc:subject>
          <dc:title>On equivalence of additive-combinatorial inequalities for Shannon entropy and differential entropy</dc:title>
          <dc:type>text</dc:type>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical &amp; Computer Eng</department>
            <discipline>Electrical &amp; Computer Engr</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
