Monthly Archives: September 2015

Redundancy Bits Graphed (m + r vs r) – Internet Protocol (OSI Model)

redundancy bits graphed logarithmic

While going through redundancy checks in Internet Protocol this week, we were shown this homework problem by our professor [1]: Using plotting software (Matlab, Maple, Excel…) give the graph for the number of redundant bits r required for m + r (data and redundant) message bits. The x-axis must measure the m + r bits and range from 1 to 5000 bits. What does the shape of the graph represent? What does this mean? Courtesy of Dr. Fulp’s lecture slides [2]: to find the number of redundancy bits r required for each message m, we must find a relationship between message length (in bits) m and the number of redundancy bits r. m + r bits  => …

Continue reading

Posted in Uncategorized.