By Topic

The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
En-Hui Yang ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; Zhen Zhang

The redundancy problem of universal lossy source coding at a fixed rate level is considered. Under some condition on the single-letter distortion measure, which implies that the cardinality K of the reproduction alphabet is not greater than the cardinality J of the source alphabet, it is shown that the redundancy of universally coding memoryless sources p by nth-order block codes of rate R goes like |(∂/∂R)d(p,R)|Kln n/2n+o(ln n/n) for all memoryless sources p except a set whose volume goes to 0 as the block length n goes to infinity, where d(p,R) denotes the distortion rate function of p. Specifically, for any sequence {Cn}n=1 of block codes, where Cn is an nth-order block code at the fixed rate R, and any ε>0, the redundancy Dn(C n,p) of Cn for p is greater than or equal to |(∂/∂R)d(p,R)|(K-ε)ln n/2n for all p satisfying some regular conditions except a set whose volume goes to 0 as n→∞. On the other hand, there exists a sequence {Cn}n=1 of block codes at the rate R such that for any p satisfying some regular conditions, the super limit of Dn(Cn,p)|(ln n/n) is less than or equal to |(∂/∂R)d(p,R)|K/2

Published in:

IEEE Transactions on Information Theory  (Volume:47 ,  Issue: 1 )