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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Entropy-Based Bounds On Redundancies Of Huffman Codes


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    01.06.1992



    Medientyp :

    Sonstige


    Format :

    Keine Angabe


    Sprache :

    Englisch




    Grundfos redundancies

    Online Contents | 2003




    BT makes redundancies though sales grow

    British Library Online Contents | 2008


    Risk and redundancies: the staff threat

    British Library Online Contents | 2009