Error-Correcting Codes with Feedback¶
Channel codes whose encoder causally adapts later transmissions to receiver-side information returned over a feedback link, with reliability, rate, delay, stopping, and feedback-noise assumptions stated as part of the code.
Core Idea¶
Error-Correcting Codes with Feedback are channel codes in which information derived from the receiver’s observations returns to the transmitter and causally changes later channel inputs. In an ideal output-feedback model, a message \(W\in\{1,\ldots,M\}\) is sent over a forward channel and the encoder at time (i) chooses
where (Y^{i-1}) is the receiver’s past output sequence returned noiselessly and without delay. The receiver ultimately computes \(\widehat W=g(Y^n)\), or stops at a random time \(\tau\) in a variable-length scheme. In noisy, delayed, rate-limited, or active-feedback models, the transmitter instead sees a causally available feedback record (Z^{i-1}) generated through an explicitly modeled reverse link.
Scope of Application¶
For a discrete memoryless channel with noiseless output feedback, fixed-block codes allow each input to depend on past outputs. Shannon proved that this does not increase ordinary capacity, but the code tree can alter error probabilities and zero-error distinguishability. Berlekamp developed fixed-block feedback coding for the binary symmetric channel and its adversarial/search interpretations.
Sequential and variable-length schemes use feedback more deeply. Horstein’s binary symmetric-channel procedure continually refines the receiver’s posterior location of the message. Posterior matching generalizes the principle: transmit so the current message posterior is mapped back into the chosen input distribution, making the Horstein and Schalkwijk–Kailath schemes instances of one framework for memoryless channels.
Clarity¶
“Feedback” must specify what, when, and how reliably. Full output feedback returns every (Y_i). Decision feedback may return an estimate or confidence. ACK/NACK returns a small control alphabet. Stop-feedback sends only termination. Active feedback allows the receiver to encode reverse symbols. These are not interchangeable information structures.
Manages Complexity¶
Without feedback, a decoder’s confusion is hidden from the encoder until the predetermined block ends. The encoder must protect against all plausible noise histories with one fixed continuation. Feedback exposes a common or partially common state: which message alternatives remain likely, which symbols were erased, whether the receiver has enough evidence, or whether a confirmation is needed.
Abstract Reasoning¶
- If (X_i) is independent of every returned observation given (W), the alleged feedback code collapses to a no-feedback encoder. 2. If feedback is available only after time (n), it cannot improve the encoding decisions of a fixed length-(n) transmission. 3. If a stationary memoryless point-to-point channel has perfect feedback, ordinary asymptotic capacity remains the no-feedback capacity; any claimed gain must concern another metric or model.
Knowledge Transfer¶
The full identity transfers across discrete, Gaussian, erasure, channel-with-memory, multiuser, and adversarial settings: receiver evidence returns causally, the encoder adapts, and reliability is evaluated under a declared resource model. Theorems do not transfer freely. Shannon’s no-capacity-gain result is for memoryless point-to-point channels under the relevant capacity model. Schalkwijk–Kailath depends on ideal Gaussian assumptions. Burnashev depends on variable length and noiseless feedback. Noisy-feedback exponents require a reverse-channel model.
Relationships to Other Abstractions¶
Current abstraction Error-Correcting Codes with Feedback Domain-specific
Parents (1) — more general patterns this builds on
-
Error-Correcting Codes with Feedback is a kind of Feedback Prime
receiver-side output returns to change later encoder inputs or stopping.
Hierarchy path (1) — routes to 1 parentless root
- Error-Correcting Codes with Feedback → Feedback
Neighborhood in Abstraction Space¶
Error-Correcting Codes with Feedback sits in a sparse region of the domain-specific corpus (98th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Shannon–Weaver Communication Model — 0.80
- Model Inversion Attack — 0.75
- Communication source — 0.74
- Language expectancy theory — 0.73
- Additive White Gaussian Noise — 0.73
Computed from structural-signature embeddings · 2026-09-08