Abstract
We present an asymptotically efficient coding strategy for a stationary countably infinite source determined over a set of nonnegative integers. If the kth moment µ k of the source data is finite, then asymptotic average coding redundancy for length-n blocks, n ? ?, is upper bounded by C (log n/n) k/(k+1), where C is a nonnegative constant. The coding efficiency is demonstrated via an example of scalar quantization of random variables with generalized Gaussian distribution.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
