Binary Symmetric Channel

In coding theory, a binary symmetric channel is an idealized model of a communications channel that sends bits. In a BSC, the probability of a 1 becoming a 0 and of a 0 becoming a 1 are assumed to be the same. Since 1s and 0s may be represented very differently (as a pulse and absence of a pulse, for instance), this assumption is often not valid in practical situations. However, this assumption makes analysis much easier. Formally, let p < be the probability of an error occurring. Then the probability of a bit sent over a BSC being correctly received is (1−p), and this probability is independent of what bit is sent.

 

<< PreviousWord BrowserNext >>
xiongnu
fotheringhay
adjectival phrase
the magic roundabout
nadia comaneci
principle of relativity
ameland
andromeda galaxy
real world studios
chinon
william v of orange
space invaders
foster hewitt
second variety
robert simpson
dupont manual magnet high school
sainte chapelle
william i of orange
exponent (linguistics)
herbert hoover national historical site
effigy mounds national monument
sonogram
johan willem friso of orange nassau
black hawk county, iowa
sonority hierarchy
ms.
the magic christian
square metre
shrimp plant
athanaric
michael i rhangabes
michael iii
hoosiers
hospital (1970 movie)
michael ii
michael iv
michael v
the hospital
michael vi
the house in the middle
morgan stanley
timothy chambers
michael vii
how the west was won (movie)