TOPICS
Search

Binary Symmetric Channel


A binary symmetric channel is a random transformation of a binary symbol that reverses its value with a fixed probability p and leaves it unchanged with probability 1-p. Here 0<=p<=1 is the crossover probability. A vector of signs X in {-1,1}^n produces Y_i=X_iZ_i, where the signs Z_i in {-1,1} are independent of X and one another and satisfy Pr(Z_i=-1)=p (Courtade and Kumar 2014, p. 4516).

At p=0 the input is preserved, while at p=1/2 the output contains no mutual information about the input. The corresponding Boolean noise operator has parameter rho=1-2p.


See also

Boolean Noise Operator, Courtade-Kumar Conjecture, Hellinger Conjecture, Mutual Information, Noise

Explore with Wolfram|Alpha

References

Courtade, T. A. and Kumar, G. R. "Which Boolean Functions Maximize Mutual Information on Noisy Inputs?" IEEE Trans. Inform. Th. 60, 4515-4525, 2014. https://doi.org/10.1109/TIT.2014.2326877.

Cite this as:

Weisstein, Eric W. "Binary Symmetric Channel." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BinarySymmetricChannel.html

Subject classifications