Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01g158bk964
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorCuff, Paul-
dc.contributor.advisorVerdu, Sergio-
dc.contributor.authorLiu, Jingbo-
dc.contributor.otherElectrical Engineering Department-
dc.date.accessioned2018-02-05T16:47:00Z-
dc.date.available2018-02-05T16:47:00Z-
dc.date.issued2018-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01g158bk964-
dc.description.abstractA perennial theme of information theory is to find new methods to determine the fundamental limits of various communication systems, which potentially helps the engineers to find better designs by eliminating the deficient ones. Traditional meth- ods have focused on the notion of “sets”: the method of types concerns the cardinality of subsets of the typical sets; the blowing-up lemma bounds the probability of the neighborhood of decoding sets; the single-shot (information-spectrum) approach uses the likelihood threshold to define sets. This thesis promotes the idea of deriving the fundamental limits using functional inequalities, where the central notion is “func- tions” instead of “sets”. A functional inequality follows from the entropic definition of an information measure by convex duality. For example, the Gibbs variational formula follows from the Legendre transform of the relative entropy. As a first example, we propose a new methodology of deriving converse (i.e. im- possibility) bounds based on convex duality and the reverse hypercontractivity of Markov semigroups. This methodology is broadly applicable to network information theory, and in particular resolves the optimal scaling of the second-order rate for the previously open “side-information problems”. As a second example, we use the functional inequality for the so-called Eγmetric to prove non-asymptotic achievability (i.e. existence) bounds for several problems including source coding, wiretap channels and mutual covering. Along the way, we derive general convex duality results leading to a unified treat- ment to many inequalities and information measures such as the Brascamp-Lieb in- equality and its reverse, strong data processing inequality, hypercontractivity and its reverse,transportation-cost inequalities, and Rényi divergences. Capitalizing on such dualities, we demonstrate information-theoretic approaches to certain properties of functional inequalities, such as the Gaussian optimality. This is the antithesis of the main thesis (functional approaches to information theory).-
dc.language.isoen-
dc.publisherPrinceton, NJ : Princeton University-
dc.relation.isformatofThe Mudd Manuscript Library retains one bound copy of each dissertation. Search for these copies in the library's main catalog: <a href=http://catalog.princeton.edu> catalog.princeton.edu </a>-
dc.subjectcommon randomness-
dc.subjectfunctional inequality-
dc.subjecthigh dimensional-
dc.subjectinformation theory-
dc.subjectmultiuser-
dc.subjectnon-asymptotic-
dc.subject.classificationElectrical engineering-
dc.subject.classificationMathematics-
dc.subject.classificationStatistics-
dc.titleInformation Theory from A Functional Viewpoint-
dc.typeAcademic dissertations (Ph.D.)-
pu.projectgrantnumber690-2143-
Appears in Collections:Electrical Engineering

Files in This Item:
File Description SizeFormat 
Liu_princeton_0181D_12396.pdf1.99 MBAdobe PDFView/Download


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.