Error detecting and error correcting codes
E488674
"Error detecting and error correcting codes" is a seminal 1950 paper by Richard W. Hamming that founded the modern theory of error-correcting codes in digital communication and data storage.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Error detecting and error correcting codes canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5036921 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Error detecting and error correcting codes Context triple: [Richard W. Hamming, notableWork, Error detecting and error correcting codes]
-
A.
Algebraic Coding Theory
Algebraic Coding Theory is a foundational mathematical text that systematically develops the theory and applications of error-correcting codes using algebraic methods.
-
B.
LDPC
LDPC (Low-Density Parity-Check) is a powerful class of linear error-correcting codes known for near-Shannon-limit performance and widespread use in modern high-throughput communication systems.
-
C.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
D.
Mathematical Foundations of Information Theory
Mathematical Foundations of Information Theory is a seminal monograph by Aleksandr Khinchin that rigorously develops the probabilistic and mathematical basis of Shannon’s information theory.
-
E.
Berlekamp’s algorithm for factoring polynomials over finite fields
Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Error detecting and error correcting codes Target entity description: "Error detecting and error correcting codes" is a seminal 1950 paper by Richard W. Hamming that founded the modern theory of error-correcting codes in digital communication and data storage.
-
A.
Algebraic Coding Theory
Algebraic Coding Theory is a foundational mathematical text that systematically develops the theory and applications of error-correcting codes using algebraic methods.
-
B.
LDPC
LDPC (Low-Density Parity-Check) is a powerful class of linear error-correcting codes known for near-Shannon-limit performance and widespread use in modern high-throughput communication systems.
-
C.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
D.
Mathematical Foundations of Information Theory
Mathematical Foundations of Information Theory is a seminal monograph by Aleksandr Khinchin that rigorously develops the probabilistic and mathematical basis of Shannon’s information theory.
-
E.
Berlekamp’s algorithm for factoring polynomials over finite fields
Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
journal article
ⓘ
scientific paper ⓘ |
| alsoKnownAs | Hamming 1950 paper on error-correcting codes ⓘ |
| author |
R. W. Hamming
NERFINISHED
ⓘ
Richard W. Hamming NERFINISHED ⓘ |
| citationRole | classic reference in coding theory literature ⓘ |
| citedAs |
foundational work in coding theory
ⓘ
seminal paper in error-correcting codes ⓘ |
| countryOfPublication |
United States of America
ⓘ
surface form:
United States
|
| describes |
methods for correcting transmission errors
ⓘ
methods for detecting transmission errors ⓘ |
| field |
coding theory
ⓘ
data storage ⓘ digital communications ⓘ information theory ⓘ |
| goal |
increase reliability of data storage
ⓘ
increase reliability of digital communication ⓘ |
| hasImpactOn |
information storage systems
ⓘ
telecommunications engineering ⓘ theoretical computer science ⓘ |
| hasTopic |
binary codes
ⓘ
block codes ⓘ check equations ⓘ error correction ⓘ error detection ⓘ linear codes ⓘ minimum distance of a code ⓘ parity bits ⓘ redundancy in coding ⓘ |
| influenced |
computer memory error protection
ⓘ
data storage reliability techniques ⓘ digital communication systems design ⓘ modern error-correcting code theory ⓘ |
| introducedConcept |
Hamming code
NERFINISHED
ⓘ
error-detecting code ⓘ parity-check matrix formulation for codes ⓘ single-error-correcting code ⓘ |
| language | English ⓘ |
| namedAfter | Richard W. Hamming NERFINISHED ⓘ |
| publicationYear | 1950 ⓘ |
| publishedIn | Bell System Technical Journal NERFINISHED ⓘ |
| publisher | Bell Telephone Laboratories NERFINISHED ⓘ |
| relatedTo |
Shannon information theory
NERFINISHED
ⓘ
channel coding ⓘ error-control coding ⓘ |
| timePeriod | 20th century ⓘ |
| typeOfWork | theoretical research ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Error detecting and error correcting codes Description of subject: "Error detecting and error correcting codes" is a seminal 1950 paper by Richard W. Hamming that founded the modern theory of error-correcting codes in digital communication and data storage.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.