TY - GEN
T1 - Lower bounds on rate of fixed-length source codes under average- and 6-fidelity constraints
AU - Moulin, Pierre
N1 - Publisher Copyright:
© 2017 IEEE.
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
T3 - IEEE International Symposium on Information Theory - Proceedings
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 -