Think about when Huffman’s algorithm does reduce required bit transmission. Use Huffman’s algorithm on the following string: “catsatonhatcathat” (counting the frequencies to make your own frequency histogram). Then try Huffman’s algorithm using trigrams (your stride is 3), start with “cat”, “sat”, “onh”... etc. Use Huffman’s on the following dictionary: cat, sat, on, hat. Calculate and compare the data compression assuming each character in the dictionary is standard 8-bit among the three methods above.

Explanation: Huffman Algorithm A lossless data compression algorithm is Huffman coding. Input…

Answered: Think about when Huffman’s algorithm…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Think about when Huffman’s algorithm does reduce required bit transmission. Use Huffman’s algorithm on the following string: “catsatonhatcathat” (counting the frequencies to make your own frequency histogram). Then try Huffman’s algorithm using trigrams (your stride is 3), start with “cat”, “sat”, “onh”... etc. Use Huffman’s on the following dictionary: cat, sat, on, hat. Calculate and compare the data compression assuming each character in the dictionary is standard 8-bit among the three methods above.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 7 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions