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: Hamming bound | Statement: [Richard W. Hamming, knownFor, Hamming bound]

Target entity: Hamming bound
Context triple: [Richard W. Hamming, knownFor, Hamming bound]

• 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. Cramér–Rao bound
  The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
• D. Bekenstein bound
  The Bekenstein bound is a theoretical limit in physics on the maximum amount of information or entropy that can be contained within a finite region of space with a given amount of energy.
• E. Golomb
  Golomb is a station on the Carmelit underground funicular system in Haifa, Israel.
• 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: Hamming bound
Triple: [Richard W. Hamming, knownFor, Hamming bound]

The Hamming bound is a fundamental limit in coding theory that specifies the maximum number of codewords a block code can have for a given length and minimum distance while still allowing reliable error detection and correction.

Target entity: Hamming bound
Target entity description: The Hamming bound is a fundamental limit in coding theory that specifies the maximum number of codewords a block code can have for a given length and minimum distance while still allowing reliable error detection and correction.

• 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. Cramér–Rao bound
  The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
• D. Bekenstein bound
  The Bekenstein bound is a theoretical limit in physics on the maximum amount of information or entropy that can be contained within a finite region of space with a given amount of energy.
• E. Golomb
  Golomb is a station on the Carmelit underground funicular system in Haifa, Israel.
• F. None of above. chosen