Assume that a binary symmetric channel is defined by the error probability p = 10-2.
Using the technique defined, with pk independent of k, simulate the transmission of N symbols through the channel for N = 100, N = 1,000 and N = 10,000.
In each case count the number of errors that actually occur and calculate the BER resulting from the simulation. Repeat this experiment ten times for each value of N. What do you conclude?