Binary symmetric channel

related topics
{math, number, function}
{system, computer, user}
{math, energy, light}

A binary symmetric channel (or BSC) 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 receives a bit. It is assumed that the bit is usually transmitted correctly, but that it will be "flipped" with a small probability (the "crossover probability"). This channel is used frequently in information theory because it is one of the simplest channels to analyze.

Contents

Description

The BSC is a binary channel; that is, it can transmit only one of two symbols (usually called 0 and 1). (A non-binary channel would be capable of transmitting more than 2 symbols, possibly even an infinite number of choices.) The transmission is not perfect, and occasionally the receiver gets the wrong bit.

This channel is often used by theorists because it is one of the simplest noisy channels to analyze. Many problems in communication theory can be reduced to a BSC. On the other hand, being able to transmit effectively over the BSC can give rise to solutions for more complicated channels.

Definition

A binary symmetric channel with crossover probability p denoted by BSCp, is a channel with binary input and binary output and probability of error p; that is, if X is the transmitted random variable and Y the received variable, then the channel is characterized by the conditional probabilities

It is assumed that 0 ≤ p ≤ 1/2. If p > 1/2, then the receiver can swap the output (interpret 1 when it sees 0, and vice versa) and obtain an equivalent channel with crossover probability 1 − p ≤ 1/2.

Capacity of BSCp

The capacity of the channel is 1 − H(p), where H(p) is the binary entropy function.

Full article ▸

related documents
Cfront
XBasic
Common Language Runtime
Sequential access
XPointer
Small-C
Yacc
Filter (Unix)
Typed link
Canonical Encoding Rules
Dining cryptographers protocol
Entropy encoding
Name server
RIPEMD
Cypherpunk anonymous remailer
Spaced repetition
A-law algorithm
Abbreviated Test Language for All Systems
Liouville function
Euler's sum of powers conjecture
Centralizer and normalizer
Dia (software)
Code word
Tomaž Pisanski
Unavailability
SISAL
Fibonacci
Foobar
UnrealScript
Face (geometry)