Grades 9–12

How can we check whether a message arrived reliably?

A message can arrive with all its bits intact and still be false or misunderstood. Transmission, authorship and interpretation are different relationships between information and the world. Understanding reliability begins with knowing which relationship a particular check examines.

In the diagramEven parity adds one check bitFour data bitsParityOriginal stored record101 bit flippedRead-back record3 ones → parity failsPass ≠ proof of no error · no correction here

A check bit can reveal certain changes in a record. Passing one consistency check does not establish every kind of reliability.

An even-parity bit makes the number of ones in a record even. Flipping one bit changes that count by one, making it odd and exposing an inconsistency. Two flips preserve evenness, so they escape the same check. A failed parity check also cannot locate the changed position: several different damaged records can give the same failure. Extra structure is needed to recover the original.

Repeating a bit three times supplies that structure for a limited error model. If 0 is encoded as 000 and 1 as 111, one changed position still leaves two copies agreeing with what was sent. Majority decoding recovers it. Two changes make the wrong bit the majority. The protection comes from separating the valid patterns, not from a decoder knowing the intended message.

A digital signature uses a private signing key and a corresponding public verification key to check a mathematical relationship with the exact message bytes. Whether the public key belongs to the expected person and whether the signing key was misused remain separate questions. Meaning needs evidence too: an ancient script may fit several symbol mappings until another inscription distinguishes them. Correcting bits, verifying a signature and establishing an interpretation solve complementary problems; passing one check does not silently answer the others.

Where these ideas lead

How can a check bit reveal a data error?
A check bit detects certain changes under a stated encoding rule.
What can three-bit repetition correct—and what can it miss?
Redundant copies can correct a bounded number of errors.
What does a digital signature check establish?
Signature verification checks a relation between bytes, a signature and a trusted key.
When does a parallel record constrain a decoding?
A plausible decoding needs evidence that connects symbols with meanings.

Illustrations simplify the real processes; any invented quantities or records are identified in the text.

Sources

Carnegie Mellon University / Communications of the ACM — Error Correction Up to the Information-Theoretic Limit
Carnegie Mellon University — Coding and Error Detection
Massachusetts Institute of Technology, 18.310 — Matrix Hamming Codes: Distance and repetition decoding
NIST Computer Security Resource Center — Digital signature: glossary
RFC Editor / IETF — PKCS #1 v2.2, signature and verification primitives, Section 5.2
British Museum — Hieroglyphs: unlocking ancient Egypt — large print exhibition guide
British Museum — Examine the Rosetta Stone
University of Cambridge — Cracking the code: the decipherment of Linear B 60 years on
University of Cambridge, Faculty of Classics — The Decipherment of Linear B: Introduction

← More connected ideas