<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-22T08:53:11Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/70039" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/70039</identifier><datestamp>2026-05-15T19:50:37Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Shende, Nirmal Vijay</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Wagner, Aaron B.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Acharya, Jayadev</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Studer, Christoph</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Tong, Lang</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-06-23T18:00:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-07-17T06:01:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2019-12</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 11780</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 27544587</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/70039</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/js3f-j416</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">13119637</dim:field>
   <dim:field mdschema="dc" element="description">170 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">We study the following three information-theoretic problems using tools derived from stochastic calculus: the multi-receiver Poisson channel, lossy compression of point-processes, and the second-order coding rate in discrete memoryless channels (DMCs) with feedback. We obtain a general formula for the mutual information involving the point processes that allows for conditioning and the use of auxiliary random variables. We then use this formula to compute necessary and sufficient conditions under which one Poisson channel is less noisy and/or more capable than another, which turn out to be distinct from the conditions under which this ordering holds for the discretized versions of the channels. We also use the general formula to determine the capacity region of various multi-receiver Poisson channel. We introduce a new distortion measure for point processes called functional covering distortion. We obtain the distortion-rate function with feedforward under this distortion measure for a large class of point processes. For Poisson processes, stronger results are obtained by constraining the reconstruction. We derive the rate-distortion function for this constrained functional-covering and show that feedforward does not improve it. Moreover, we characterize the rate-distortion region for a two-encoder CEO problem for Poisson process and show that feedforward does not improve this region. As a corollary, we obtain the rate-distortion region of remote Poisson source. A strong data processing inequality for Poisson processes under superposition is derived to prove the converse of the CEO problem. For DMCs, we show that feedback does not improve the second-order coding rate for a class of DMCs which complements the class of channels for which feedback is known to improve the second-order coding rate. We derive an upper bound on the achievable rate with feedback utilizing a novel proof technique for general DMCs.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights">Attribution-NonCommercial-NoDerivatives 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://creativecommons.org/licenses/by-nc-nd/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject">Channel Capacity</dim:field>
   <dim:field mdschema="dc" element="subject">Information Theory</dim:field>
   <dim:field mdschema="dc" element="subject">Point Processes</dim:field>
   <dim:field mdschema="dc" element="subject">Poisson Process</dim:field>
   <dim:field mdschema="dc" element="subject">Rate Distortion</dim:field>
   <dim:field mdschema="dc" element="subject">Stochastic Calculus</dim:field>
   <dim:field mdschema="dc" element="title">The Stochastic-Calculus Approach to Selected Topics in Information Theory</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/13119637</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Shende, Nirmal Vijay</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f5f0ffaf-a7cc-4029-b527-1114b1766430">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>The Stochastic-Calculus Approach to Selected Topics in Information Theory&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2019-12&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/js3f-j416&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Shende, Nirmal Vijay&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://creativecommons.org/licenses/by-nc-nd/4.0/&lt;/License>
    &lt;Keyword>Channel Capacity&lt;/Keyword>
    &lt;Keyword>Information Theory&lt;/Keyword>
    &lt;Keyword>Point Processes&lt;/Keyword>
    &lt;Keyword>Poisson Process&lt;/Keyword>
    &lt;Keyword>Rate Distortion&lt;/Keyword>
    &lt;Keyword>Stochastic Calculus&lt;/Keyword>
   	&lt;Abstract>We study the following three information-theoretic problems using tools derived from stochastic calculus: the multi-receiver Poisson channel, lossy compression of point-processes, and the second-order coding rate in discrete memoryless channels (DMCs) with feedback. We obtain a general formula for the mutual information involving the point processes that allows for conditioning and the use of auxiliary random variables. We then use this formula to compute necessary and sufficient conditions under which one Poisson channel is less noisy and/or more capable than another, which turn out to be distinct from the conditions under which this ordering holds for the discretized versions of the channels. We also use the general formula to determine the capacity region of various multi-receiver Poisson channel. We introduce a new distortion measure for point processes called functional covering distortion. We obtain the distortion-rate function with feedforward under this distortion measure for a large class of point processes. For Poisson processes, stronger results are obtained by constraining the reconstruction. We derive the rate-distortion function for this constrained functional-covering and show that feedforward does not improve it. Moreover, we characterize the rate-distortion region for a two-encoder CEO problem for Poisson process and show that feedforward does not improve this region. As a corollary, we obtain the rate-distortion region of remote Poisson source. A strong data processing inequality for Poisson processes under superposition is derived to prove the converse of the CEO problem. For DMCs, we show that feedback does not improve the second-order coding rate for a class of DMCs which complements the class of channels for which feedback is known to improve the second-order coding rate. We derive an upper bound on the achievable rate with feedback utilizing a novel proof technique for general DMCs.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>