文件名称:parisaG
介绍说明－－下载内容均来自于网络，请自行研究使用
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
parisaG.m