文件名称: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
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.