Binary erasure channel

A memoryless channel model that delivers each input bit correctly or replaces it with an explicit erasure symbol at a fixed probability.

Version

v2 · 2026-09-19 · History

Domain-specific #

3464

Domain group

Formal Sciences

Origin domain

Information Theory

Aliases

BEC

Core Idea

The output never flips a bit, erasures are assumed independent in the basic model and capacity equals one minus erasure probability per channel use. Each binary symbol passes through unchanged with complementary probability or becomes a third erasure output whose location is known to the receiver, simplifying decoding uncertainty to missing values. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Smudged-But-Never-Wrong Notes

Imagine passing notes that say only 'yes' or 'no' to a friend. Sometimes a raindrop smudges a note so it can't be read, but a note never gets changed into the wrong word. Your friend always knows which notes got smudged. That kind of message path is a Binary erasure channel.

The Lost-Not-Wrong Channel

Computers send messages as 0s and 1s, and the path they travel on is called a channel. In a Binary erasure channel, each bit either arrives exactly as it was sent or gets wiped out and replaced by a special 'erased' mark. A 0 never sneaks through as a 1, and you always know which spots were erased. Each bit has the same chance of being erased, separately from the others. If that chance is e, then on average only the fraction 1 - e of bits get through, and that is the most information the channel can carry per bit sent.

Known-Erasure Bit Channel

The Binary erasure channel is a simple model of a noisy communication link. Its input is a bit, 0 or 1, and its output has three possibilities: 0, 1, or an erasure symbol. With probability e (between 0 and 1) the bit is erased, and otherwise it arrives unchanged; the output is never the wrong bit. In the basic model each use of the channel is independent of the others, which is called being memoryless. Because the receiver knows exactly where the gaps are, decoding becomes a matter of filling in missing values rather than hunting for errors. Its capacity, the highest rate at which information can be sent reliably, is 1 - e bits per channel use.

 

The Binary erasure channel (BEC) is a discrete memoryless channel with binary input alphabet {0, 1} and ternary output alphabet {0, 1, ?}, where ? is the erasure symbol. For erasure probability e in [0, 1], each input symbol is delivered intact with probability 1 - e and replaced by ? with probability e; there are no crossovers, so the transition matrix has zeros in the 0-to-1 and 1-to-0 entries. Erasures occur independently across channel uses in the basic model, and their locations are known to the receiver. This reduces the decoder's uncertainty to a missing-data problem, which is what makes the BEC analytically clean. Maximizing mutual information over the input distribution, achieved by equiprobable inputs, gives capacity C = 1 - e bits per channel use. Analyses should state the erasure probability, the memoryless assumption, and the code and decoder assumptions explicitly, and not transfer BEC results to channels that also flip bits.

Scope of Application

Binary erasure channel belongs to information theory and is useful where the analyst can specify the typed information theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the binary input and ternary output alphabets, erasure symbol, erasure probability and range, conditional-probability matrix, memorylessness, input distribution, mutual information and capacity and code or decoder assumptions are explicit. The scope is broad within that domain but bounded by the need for the binary input and ternary output alphabets, erasure symbol, erasure probability and range, conditional-probability matrix, memorylessness, input distribution, mutual information and capacity and code or decoder assumptions are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the binary input and ternary output alphabets, erasure symbol, erasure probability and range, conditional-probability matrix, memorylessness, input distribution, mutual information and capacity and code or decoder assumptions are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Binary erasure channel. Binary erasure channel compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed information theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the binary input and ternary output alphabets, erasure symbol, erasure probability and range, conditional-probability matrix, memorylessness, input distribution, mutual information and capacity and code or decoder assumptions are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of information theory because they reuse the typed information theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Each binary symbol passes through unchanged with complementary probability or becomes a third erasure output whose location is known to the receiver, simplifying decoding uncertainty to missing values., and type the carrier, state every parameter and convention in the definition, test that the binary input and ternary output alphabets, erasure symbol, erasure probability and range, conditional-probability matrix, memorylessness, input distribution, mutual information and capacity and code or decoder assumptions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Binary erasure channel Domain-specific

Parents (1) — outgoing typed relations

• Binary erasure channel is a kind of Channel Prime

  It remains its own entry because its identity is fixed by the binary input and ternary output alphabets, erasure symbol, erasure probability and range, conditional-probability matrix, memorylessness, input distribution, mutual information and capacity and code or decoder assumptions.

Hierarchy path (1) — routes to 1 parentless root

• Binary erasure channel → is a kind of Channel

Neighborhood in Abstraction Space

Binary erasure channel sits in a crowded region of the domain-specific corpus (17^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Information Theory & Error-Correcting Codes (20 abstractions)

Nearest neighbors

• Typical set — 0.91
• Binary entropy function — 0.91
• Information dimension — 0.90
• Shannon–Fano–Elias coding — 0.90
• Line code — 0.90

Computed from structural-signature embeddings · 2026-10-25