Skip to main content

Universal Source Coding in the Non-Asymptotic Regime


Abstract Fundamental limits of fixed-to-variable (F-V) and variable-to-fixed (V-F) length universal source coding at short blocklengths is characterized. For F-V length coding, the Type Size (TS) code has previously been shown to be optimal up to the third-order rate for universal compression of all memoryless sources over finite alphabets. The TS code assigns sequences ordered based on their type class sizes to binary strings ordered lexicographically.

Universal F-V coding problem for the class of first-order stationary, irreducible and aperiodic Markov sources is first considered. Third-order coding rate of the TS code for the Markov class is derived. A converse on the third-order coding rate for the general class of F-V codes is presented which ... (more)
Created Date 2018
Contributor Iri, Nematollah (Author) / Kosut, Oliver (Advisor) / Bliss, Daniel (Committee member) / Sankar, Lalitha (Committee member) / Zhang, Junshan (Committee member) / Arizona State University (Publisher)
Subject Electrical engineering / Information science / Data Compression / Fine Asymptotics / Finite Blocklength / Non-asymptotics / Universal Source Coding
Type Doctoral Dissertation
Extent 98 pages
Language English
Copyright
Reuse Permissions All Rights Reserved
Note Doctoral Dissertation Electrical Engineering 2018
Collaborating Institutions Graduate College / ASU Library
Additional Formats MODS / OAI Dublin Core / RIS


  Full Text
587.5 KB application/pdf
Download Count: 81

Description Dissertation/Thesis