Abstract

Sample-based (or adaptive) block codes represent a transitional case: while the exact parameters of a source are not known, one can obtain finite length sequences of symbols (or samples) produced by this source in the past. It turns out, that using such samples it is possible to construct codes that are more efficient in encoding this particular source than pure universal codes. In order to be able to compare adaptive codes and codes for a known source more precisely one clearly needs to know the exact expression of an O (1/n). Obtaining the exact expression for this and subsequent terms describing the average behavior of adaptive block codes is the main goal of this paper.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.