= A packet contains n bits. That is, the packet length is n. Each bit sent across a BSC(p), a binary symmetric channel with error/crossover probability p. Each bit sent/transmitted over the BSC incurs a possible errors. The errors are IID. a) If any single bit causes a packet error, and p = 0.01, what is the largest packet length n that can accommodate a packet error probability (one or more single bits in error) of 0.1. b) Error correcting codes are now used in our transmitter. This allows the packet to tolerate more than a single error. If the system can tolerate only r or less errors, what is the increase in allowable packet length, for r = 2,3,4. Be sure and give a general expression for any n, p, r before computing numbers. Any computational technique is sufficient to obtain your result. = = A packet contains n bits. That is, the packet length is n. Each bit sent across a BSC(p), a binary symmetric channel with error/crossover probability p. Each bit sent/transmitted over the BSC incurs a possible errors. The errors are IID. a) If any single bit causes a packet error, and p = 0.01, what is the largest packet length n that can accommodate a packet error probability (one or more single bits in error) of 0.1. b) Error correcting codes are now used in our transmitter. This allows the packet to tolerate more than a single error. If the system can tolerate only r or less errors, what is the increase in allowable packet length, for r = 2,3,4. Be sure and give a general expression for any n, p, r before computing numbers. Any computational technique is sufficient to obtain your result. =