Lower bounds on rate of fixed-length source codes under average- and 6-fidelity constraints

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

Abstract

This paper studies lossy coding of discrete memoryless sources and derives new asymptotic lower bounds on the rate of optimal fixed-length codes. Both average and excess-probability distortion constraints are studied. We show that in each case the rate of optimal codes is lower bounded by R(D) + R2/√ n + (log n)/(2n) + R4/n + o(1) where n is the block length, R(D) is Shannon's rate-distortion function, R2 is the second-order coding rate, and R4 a constant that is explicitly identified.

Original languageEnglish (US)
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3220-3224
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Other

Other2017 IEEE International Symposium on Information Theory, ISIT 2017
CountryGermany
CityAachen
Period6/25/176/30/17

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Lower bounds on rate of fixed-length source codes under average- and 6-fidelity constraints'. Together they form a unique fingerprint.

  • Cite this

    Moulin, P. (2017). Lower bounds on rate of fixed-length source codes under average- and 6-fidelity constraints. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 3220-3224). [8007124] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8007124