Home / Computing / Data compression

Data compression

Vary repetition and compare RLE and Huffman bit counts.

    CS06 · Data compression0.00 s · Ready

    Computing · Data representation / Principles and exploration

    Data compression experiment guide

    Vary repetition and compare RLE and Huffman bit counts.

    How does it work?

    Repetition and symbol frequencies determine compression efficiency.

    Key relationship

    H ≤ L < H + 1 · ratio = compressed / original

    Try this investigation

    1. Vary repetition and compare RLE and Huffman bit counts.
    2. Run and record each of the three reference settings.
    3. Change one variable and compare with the reference records.

    Interpreting your results

    How are frequent symbols coded in Huffman?

    Usually shorter · Repetition and symbol frequencies determine compression efficiency.

    Assumptions and limitations

    Inputs use four symbols. Originals use 8 bits per symbol; RLE uses 8-bit symbol and count. Huffman table overhead is excluded.