Suppose bit stuffing with 0 is used after 5 consecutive 1’s. Assuming the probabilities of 0’s and 1’s in the bit stream are equal and the occurrences are at random, what is the transmission overhead of the bit stuffing scheme? (Hint: Formulate a recursive formula f(n) to find the expected number of overhead bits in an n -bit string first.)
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here