Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Error detecting and error correcting codes | Statement: [Richard W. Hamming, notableWork, Error detecting and error correcting codes]

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.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Error detecting and error correcting codes
Triple: [Richard W. Hamming, notableWork, Error detecting and error correcting codes]

"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.

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