Report presents extension of theory of redundancy of binary prefix code of Huffman type which includes derivation of variety of bounds expressed in terms of entropy of source and size of alphabet. Recent developments yielded bounds on redundancy of Huffman code in terms of probabilities of various components in source alphabet. In practice, redundancies of optimal prefix codes often closer to 0 than to 1.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Entropy-Based Bounds On Redundancies Of Huffman Codes


    Contributors:

    Published in:

    Publication date :

    1992-06-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English




    Grundfos redundancies

    Online Contents | 2003




    Risk and redundancies: the staff threat

    British Library Online Contents | 2009


    BT makes redundancies though sales grow

    British Library Online Contents | 2008