Scribd Logo
Upload

Welcome to Scribd!

  • To Demonstrate How The Pieces Work Together, We Can Repeat Our Example

    Uploaded by

    Dhaval Mehta
    6 views1 page
    This document demonstrates how to use Huffman coding to compress data. It defines a sample alphabet and probability distribution, generates a Huffman tree and coding table, encodes a sample message using the table, and then decodes the encoded message back to the original using the tree. The key steps are: 1) defining the alphabet and probabilities; 2) generating a Huffman tree and coding table; 3) encoding the message using the table; and 4) decoding the encoded message using the tree.

    Original Description:

    how to use

    Original Title

    How to use

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document demonstrates how to use Huffman coding to compress data. It defines a sample alphabet and probability distribution, generates a Huffman tree and coding table, encodes a sample message using the table, and then decodes the encoded message back to the original using the tree. The key steps are: 1) defining the alphabet and probabilities; 2) generating a Huffman tree and coding table; 3) encoding the message using the table; and 4) decoding the encoded message using the tree.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    To Demonstrate How The Pieces Work Together, We Can Repeat Our Example

    Uploaded by

    Dhaval Mehta
    This document demonstrates how to use Huffman coding to compress data. It defines a sample alphabet and probability distribution, generates a Huffman tree and coding table, encodes a sample message using the table, and then decodes the encoded message back to the original using the tree. The key steps are: 1) defining the alphabet and probabilities; 2) generating a Huffman tree and coding table; 3) encoding the message using the table; and 4) decoding the encoded message using the tree.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    To demonstrate how the pieces work together, we can repeat our example:

    >> alphabet = {'0' '1' '2' '3' '4' '5' '6' '7'};
    >> p = [0.05 0.2 0 0.2 0.1 0.25 0.05 0.15];
    >> [tree, tab] = hufftree(alphabet,p);
    >> tab

    tab =

    val: {'1' '3' '5' '7' '2' '0' '6' '4'}


    code: {'00' '01' '10' '110' '111000' '111001' '11101' '1111'}

    >> message = {'1' '3' '3' '7' '1' '5' '4' '5' '1' '5' '5' '1' '3' '5' '7'
    '0' '6' '3' '4' '7'};
    >> code = huffencode(message,tab)

    code =

    000101110001011111000101000011011011100111101011111110

    >> decoded = huffdecode(code,tree)

    decoded =

    Columns 1 through 13

    '1' '3' '3' '7' '1' '5' '4' '5' '1' '5'
    '5' '1' '3'

    Columns 14 through 20

    '5' '7' '0' '6' '3' '4' '7'

    >>

    You might also like