Advanced Search
MyIDEAS: Login

On bounded redundancy of universal codes

Contents:

Author Info

  • Dębowski, Łukasz
Registered author(s):

    Abstract

    Consider stationary ergodic measures for which the difference between the expected length of a uniquely decodable code and the block entropy is asymptotically bounded by a constant. Using ergodic decomposition, it is shown that the number of such measures is less than the base of the logarithm raised to the power of that constant. In consequence, an analogous statement is derived for excess lengths of universal codes. The latter was previously communicated without proof.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S0167715212002799
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Statistics & Probability Letters.

    Volume (Year): 82 (2012)
    Issue (Month): 11 ()
    Pages: 2068-2071

    as in new window
    Handle: RePEc:eee:stapro:v:82:y:2012:i:11:p:2068-2071

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=505573&ref=505573_01_ooc_1&version=01

    Related research

    Keywords: Uniquely decodable codes; Entropy; Ergodic decomposition;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:82:y:2012:i:11:p:2068-2071

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.