Description: In this experiment you will simulate a symmetric binary communication system in which the probability that a bit is corrupted is p, that is P(receiving 0|1 sent) = P(receiving 1|0 sent) = p. To actually perform this experiment you will have to first develop a random number generator that produces binary random numbers.
To Search:
File list (Check if you may need any files):
parisaG.m
Download