Binary Erasure Channel
   HOME

TheInfoList



OR:

In
coding theory Coding theory is the study of the properties of codes and their respective fitness for specific applications. Codes are used for data compression, cryptography, error detection and correction, data transmission and computer data storage, data sto ...
and
information theory Information theory is the mathematical study of the quantification (science), quantification, Data storage, storage, and telecommunications, communication of information. The field was established and formalized by Claude Shannon in the 1940s, ...
, a binary erasure channel (BEC) is a
communications channel A communication channel refers either to a physical transmission medium such as a wire, or to a logical connection over a multiplexed medium such as a radio channel in telecommunications and computer networking. A channel is used for inform ...
model. A transmitter sends a
bit The bit is the most basic unit of information in computing and digital communication. The name is a portmanteau of binary digit. The bit represents a logical state with one of two possible values. These values are most commonly represented as ...
(a zero or a one), and the receiver either receives the bit correctly, or with some probability P_e receives a message that the bit was not received ("erased") .


Definition

A binary erasure channel with erasure probability P_e is a channel with binary input, ternary output, and probability of erasure P_e. That is, let X be the transmitted
random variable A random variable (also called random quantity, aleatory variable, or stochastic variable) is a Mathematics, mathematical formalization of a quantity or object which depends on randomness, random events. The term 'random variable' in its mathema ...
with alphabet \. Let Y be the received variable with alphabet \, where \text is the erasure symbol. Then, the channel is characterized by the conditional probabilities: :\begin \operatorname X = 0 &= 1 - P_e \\ \operatorname X = 1 &= 0 \\ \operatorname X = 0 &= 0 \\ \operatorname X = 1 &= 1 - P_e \\ \operatorname X = 0 &= P_e \\ \operatorname X = 1 &= P_e \end


Capacity

The
channel capacity Channel capacity, in electrical engineering, computer science, and information theory, is the theoretical maximum rate at which information can be reliably transmitted over a communication channel. Following the terms of the noisy-channel coding ...
of a BEC is 1-P_e, attained with a uniform distribution for X (i.e. half of the inputs should be 0 and half should be 1). : If the sender is notified when a bit is erased, they can repeatedly transmit each bit until it is correctly received, attaining the capacity 1-P_e. However, by the
noisy-channel coding theorem In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible (in theory) to communicate discrete ...
, the capacity of 1-P_e can be obtained even without such feedback.


Related channels

If bits are flipped rather than erased, the channel is a
binary symmetric channel A binary symmetric channel (or BSCp) 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 ...
(BSC), which has capacity 1 - \operatorname H_\text(P_e) (for the
binary entropy function Binary may refer to: Science and technology Mathematics * Binary number, a representation of numbers using only two values (0 and 1) for each digit * Binary function, a function that takes two arguments * Binary operation, a mathematical op ...
\operatorname_\text), which is less than the capacity of the BEC for 0. If bits are erased but the receiver is not notified (i.e. does not receive the output e) then the channel is a
deletion channel A deletion channel is a communications channel model used in coding theory and information theory. In this model, a transmitter sends a bit (a zero or a one), and the receiver either receives the bit (with probability p) or does not receive anythi ...
, and its capacity is an open problem.


History

The BEC was introduced by Peter Elias of MIT in 1955 as a toy example.


See also

*
Erasure code In coding theory, an erasure code is a forward error correction (FEC) code under the assumption of bit erasures (rather than bit errors), which transforms a message of ''k'' symbols into a longer message (code word) with ''n'' symbols such that ...
* Packet erasure channel


Notes


References

* * * {{citation , last = Mitzenmacher , first = Michael , authorlink = Michael Mitzenmacher , doi = 10.1214/08-PS141 , journal = Probability Surveys , mr = 2525669 , pages = 1–33 , title = A survey of results for deletion channels and related synchronization channels , volume = 6 , year = 2009, doi-access = free Coding theory