Feature Redundancy Encoding
Updated 2026-09-11
INTRODUCTION
English translation pending.
CORE DEFINITION
A principle from coding theory and information design in which one piece of information is carried by several redundant features rather than a single channel. If one representation is corrupted, misread, or lost, the remaining ones allow the original content to be recovered by majority vote or error correction. The qualification is that redundancy buys robustness at a real cost in storage, bandwidth, or compute, so it must be reserved for information whose loss is expensive. Hamming codes and biological genomes are canonical examples.
SCAFFOLDING EFFECT
Reduce cognitive load
- Redundancy audit: name the single features whose corruption would destroy your key information. - Encoding design: carry each critical fact in at least two genuinely independent representations. - Decode rule: specify in advance how conflicts between the copies are resolved, for instance by majority vote.
Anchor fast decisions
Independent channels fail for different reasons, so the probability that all of them fail simultaneously is the product of their individual failure rates. Carrying the same content across them therefore drives the joint failure probability down sharply, and a decoder that compares the copies can reconstruct the original even when one or more are damaged.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Redundancy_(information_theoryverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS