文件名称: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
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。