1 Scopus citations


With a customized characterization of types, every universal one-to-one coding algorithm can be described as follows: assign sequences to binary strings based on their type class sizes from smallest to largest. With this view, the universal coding problem is to optimally characterize types. In this paper, this Type Size approach is studied for universal source coding of an exponential family of distributions, using the most natural type class definition: two sequences are in the same type class if and only if they are indistinguishable in the sense that they have the same probability for every distribution in the family. This characterization is called the point type class. Exact third-order coding rate is derived for the resulting compression algorithm, revealing that the point type approach, while natural, is sub-optimal compared to the quantized type method, which was previously proposed by the authors.

Original languageEnglish (US)
Title of host publication2017 51st Annual Conference on Information Sciences and Systems, CISS 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509047802
StatePublished - May 10 2017
Event51st Annual Conference on Information Sciences and Systems, CISS 2017 - Baltimore, United States
Duration: Mar 22 2017Mar 24 2017


Other51st Annual Conference on Information Sciences and Systems, CISS 2017
CountryUnited States


  • Data compression
  • Fine asymptotics
  • Finite blocklength analysis
  • Universal algorithm

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems and Management
  • Computer Networks and Communications
  • Information Systems

Fingerprint Dive into the research topics of 'Universal coding with point type classes'. Together they form a unique fingerprint.

Cite this