Error Detecting and Error Correcting Codes.

Hamming, R. W. (1950). Error Detecting and Error Correcting Codes. The Bell System Technical Journal, 29(2), 147-160.

Type

Journal article

Intellectual base

Primary research

Year

1950

DOI

10.1002/j.1538-7305.1950.tb00463.x

Link

https://doi.org/10.1002/j.1538-7305.1950.tb00463.x

Cited from

computer_science, engineering_design, information_theory, mathematics, physics, statistics_experimental_design, systems_cybernetics

Cited by

9 citations across 9 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Compression

  • This sourceFoundational error-control coding (Hamming codes/distance). Tier C (bibliography only — never cited in body). DOI verified.

• Data Integrity
  • The specified threat model (accidental corruption, concurrent modification, malicious tampering, operator error)

    This sourceIntroduces single-error-correcting / double-error-detecting codes (Hamming codes) and minimum-distance theory.

• Discrete vs. Continuous (Quantization)

  • This sourceIntroduces Hamming codes for detecting and correcting errors in discrete data. Bibliography-only entry.

• Entropy (Thermodynamic Sense)

  • This sourceFoundational error-correcting-code paper (Hamming codes). Bibliography-only; not cited in the body and topically unrelated to entropy — likely a residual template entry.

• Measurement Uncertainty and Observational Noise
  • Listed in the references but not attached to a specific claim.
• Metric
  • In information theory and coding it is Hamming distance between binary strings, edit distance between texts, and Levenshtein distance for sequence alignment.

    This sourceIntroduces the Hamming distance between binary strings as a metric for coding theory; Levenshtein (1966) extends to edit distance.

• Multiplexing
  • Listed in the references but not attached to a specific claim.
• Redundancy
  • The probability of simultaneous independent failure of N components shrinks exponentially in N under independence, the load-bearing mathematical property enabling reliability levels (5, 6, 9 nines of uptime) that no single component achieves

    This sourceHamming exponential failure probability independence.

• Signal Decay and Fadeout
  • Listed in the references but not attached to a specific claim.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://onlinelibrary.wiley.com/doi/10.1002/j.1538-7305.1950.tb00463.x ×1

Registry ID ref:479ff733e83f · see in the full table