Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Binary symmetric channel
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{more footnotes|date=March 2013}} A '''binary symmetric channel''' (or '''BSC<sub>p</sub>''') is a common [[communications channel]] model used in [[coding theory]] and [[information theory]]. In this model, a transmitter wishes to send a [[bit]] (a zero or a one), and the receiver will receive a bit. The bit will be "flipped" with a "crossover [[probability]]" of ''p'', and otherwise is received correctly. This model can be applied to varied communication channels such as telephone lines or [[disk drive]] storage. The [[noisy-channel coding theorem]] applies to BSC<sub>p</sub>, saying that information can be transmitted at any rate up to the [[channel capacity]] with arbitrarily low error. The channel capacity is <math>1 - \operatorname H_\text{b}(p)</math> bits, where <math>\operatorname H_\text{b}</math> is the [[binary entropy function]]. Codes including Forney's code have been designed to transmit information efficiently across the channel.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)