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

Pierre Moulin

doi:10.1109/ISIT.2017.8007124

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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) + R₂/√ n + (log n)/(2n) + R₄/n + o(1) where n is the block length, R(D) is Shannon's rate-distortion function, R₂ is the second-order coding rate, and R₄ a constant that is explicitly identified.

Original language	English (US)
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	3220-3224
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8007124
State	Published - Aug 9 2017
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: Jun 25 2017 → Jun 30 2017

Other

Other	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	6/25/17 → 6/30/17

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Online availability

10.1109/ISIT.2017.8007124

Library availability

Discover UIUC Full Text

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., 8007124, Institute of Electrical and Electronics Engineers Inc., pp. 3220-3224, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 6/25/17. https://doi.org/10.1109/ISIT.2017.8007124

@inproceedings{43f9695a52334e5fa32db62326ac9ffa,

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

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.",

author = "Pierre Moulin",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8007124",

language = "English (US)",

pages = "3220--3224",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

}

TY - GEN

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

AU - Moulin, Pierre

PY - 2017/8/9

Y1 - 2017/8/9

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/ISIT.2017.8007124

DO - 10.1109/ISIT.2017.8007124

M3 - Conference contribution

AN - SCOPUS:85034034611

SP - 3220

EP - 3224

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017

Y2 - 25 June 2017 through 30 June 2017

ER -

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

Abstract

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this