Description
Measures how much of an interface's signal is repeated or predictable, separating protective redundancy that resists error from wasteful redundancy that adds load.
In information theory, redundancy R = 1 - H/Hmax is the fraction of a message that is predictable and could in principle be removed. Redundancy is not waste by default: Shannon showed it is what allows a receiver to correct errors over a noisy channel. Redundancy analysis applies this to interfaces by cataloguing every way a critical piece of state is encoded (colour, position, label, icon, sound, haptic) and every place it is repeated, then classifying each repetition as error-protective (independent channels encoding the same critical fact) or load-adding (repeated low-value information competing for attention). Rigour comes from computing redundancy on observed or specified message sets and from distinguishing correlated encodings, which fail together, from independent encodings that survive one channel failing, such as colour-blindness or a noisy room.
Attributes
- Discipline
- Information Theory, Physics & Mathematics
- Loss type
- Unmigrated
- Goal
- Assess risk and harm
- Stage
- Design
- Data
- Analytical / expert
- Effort
- Days
Steps
- Select the critical state variables the interface must communicate (for example mode, armed/disarmed, patient identity, unsaved changes).
- For each variable, list every encoding channel used (hue, shape, position, text, sound, vibration) and every screen location where it appears.
- Classify encodings as independent or correlated, checking failure scenarios such as colour-vision deficiency, glare, gloves, and auditory masking above 85 dB.
- Compute message redundancy 1 - H/Hmax for repeated content blocks and notification streams using observed frequencies.
- Mark critical variables with fewer than two independent encodings as under-protected and non-critical content with redundancy above 0.6 as candidates for removal.
- Propose a rebalanced encoding scheme and verify with a quick detection test (for example 10 participants, single-channel-degraded conditions).
Sources
- MacKay, D. J. C., Information Theory, Inference, and Learning Algorithms (2003)
- Kolmogorov complexity literature (MIT Press)
- Shannon, C. E., A Mathematical Theory of Communication (1948)
- MacKay (Information Theory)
- Kolmogorov via MIT Press
- Shannon's works
- The Inquiry Series, Ch 1 — Entropy, Complexity & the Information Architecture of Interaction
Also known as
- Information redundancy analysis
- Channel redundancy audit
Categories
- Information Theory, Physics & Mathematics