Universal fixed-to-variable source coding in the finite blocklength regime

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

A universal source coding problem is considered in the finite blocklength regime for stationary memoryless sources. A new coding scheme is presented that encodes based on the type class size and the empirical support set of the sequence. It is shown that there is no loss in dispersion relative to the case when the source distribution is known. A new bound is obtained on the third order asymptotic coding rate. Numerical results are presented for finite blocklengths comparing the proposed coding scheme with a variety of coding schemes including Lempel-Ziv.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages649-653
Number of pages5
DOIs
StatePublished - 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

Fingerprint

Source Coding
Coding
Numerical Results

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Kosut, O., & Sankar, L. (2013). Universal fixed-to-variable source coding in the finite blocklength regime. In IEEE International Symposium on Information Theory - Proceedings (pp. 649-653). [6620306] https://doi.org/10.1109/ISIT.2013.6620306

Universal fixed-to-variable source coding in the finite blocklength regime. / Kosut, Oliver; Sankar, Lalitha.

IEEE International Symposium on Information Theory - Proceedings. 2013. p. 649-653 6620306.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kosut, O & Sankar, L 2013, Universal fixed-to-variable source coding in the finite blocklength regime. in IEEE International Symposium on Information Theory - Proceedings., 6620306, pp. 649-653, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620306
Kosut O, Sankar L. Universal fixed-to-variable source coding in the finite blocklength regime. In IEEE International Symposium on Information Theory - Proceedings. 2013. p. 649-653. 6620306 https://doi.org/10.1109/ISIT.2013.6620306
Kosut, Oliver ; Sankar, Lalitha. / Universal fixed-to-variable source coding in the finite blocklength regime. IEEE International Symposium on Information Theory - Proceedings. 2013. pp. 649-653
@inproceedings{4c9e86890ab0457d8dc10d8fe6847de1,
title = "Universal fixed-to-variable source coding in the finite blocklength regime",
abstract = "A universal source coding problem is considered in the finite blocklength regime for stationary memoryless sources. A new coding scheme is presented that encodes based on the type class size and the empirical support set of the sequence. It is shown that there is no loss in dispersion relative to the case when the source distribution is known. A new bound is obtained on the third order asymptotic coding rate. Numerical results are presented for finite blocklengths comparing the proposed coding scheme with a variety of coding schemes including Lempel-Ziv.",
author = "Oliver Kosut and Lalitha Sankar",
year = "2013",
doi = "10.1109/ISIT.2013.6620306",
language = "English (US)",
isbn = "9781479904464",
pages = "649--653",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Universal fixed-to-variable source coding in the finite blocklength regime

AU - Kosut, Oliver

AU - Sankar, Lalitha

PY - 2013

Y1 - 2013

N2 - A universal source coding problem is considered in the finite blocklength regime for stationary memoryless sources. A new coding scheme is presented that encodes based on the type class size and the empirical support set of the sequence. It is shown that there is no loss in dispersion relative to the case when the source distribution is known. A new bound is obtained on the third order asymptotic coding rate. Numerical results are presented for finite blocklengths comparing the proposed coding scheme with a variety of coding schemes including Lempel-Ziv.

AB - A universal source coding problem is considered in the finite blocklength regime for stationary memoryless sources. A new coding scheme is presented that encodes based on the type class size and the empirical support set of the sequence. It is shown that there is no loss in dispersion relative to the case when the source distribution is known. A new bound is obtained on the third order asymptotic coding rate. Numerical results are presented for finite blocklengths comparing the proposed coding scheme with a variety of coding schemes including Lempel-Ziv.

UR - http://www.scopus.com/inward/record.url?scp=84890318324&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890318324&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620306

DO - 10.1109/ISIT.2013.6620306

M3 - Conference contribution

SN - 9781479904464

SP - 649

EP - 653

BT - IEEE International Symposium on Information Theory - Proceedings

ER -