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: q-ary Hamming bound | Statement: [Hamming bound, generalizedTo, q-ary Hamming bound]

Target entity: q-ary Hamming bound
Context triple: [Hamming bound, generalizedTo, q-ary Hamming bound]

• A. Hamming bound chosen
  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.
• B. Gilbert–Varshamov bound
  The Gilbert–Varshamov bound is a fundamental result in coding theory that provides a lower bound on the maximum size of error-correcting codes for given length and minimum distance, showing that relatively dense codes with good error-correcting capability exist.
• C. Plotkin bound
  The Plotkin bound is a fundamental result in coding theory that gives an upper limit on the size of a code with given length and minimum distance, especially strong for codes with relatively large minimum distance.
• D. Hamming code
  Hamming code is a family of error-detecting and error-correcting binary codes that enable the automatic detection and correction of single-bit errors in transmitted or stored data.
• E. Accola–Maclachlan bound
  The Accola–Maclachlan bound is a refinement in algebraic geometry that gives an improved upper limit on the size of the automorphism group of a compact Riemann surface (or algebraic curve), sharpening the classical Hurwitz bound in certain cases.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.