Give two instances of how Hamming coding and Reed-Solomon coding are different from one another.

Draw a Moore (or mealy) finite state machine that can detect the pattern 1001 or 1100, while reading a sequence of binary numbers

Consider a hypothetical 8 bit floating point machine representation with a sign bit, a 3 bit exponent, and a 4 bit mantissa (se1e2e3b1b2b3b4), where the exponent bias is 3 (add 3 to exponent of number to form machine representation). Recall that actual mantissa has 5 bits, since the leading 1 is not stored on the machine. (a) What is the number ?≈2.718 in this 8-bit format? (b) What is the number that (10100111)2 represents in this 8-bit format? (c) What is the upper bound of the relative error when representing a real number in this 8-bit format?

Referring to the lecture on complement systems, how are complement systems similar to the odometer on a bicycle.