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: Gilbert–Varshamov bound | Statement: [Hamming bound, comparedWith, Gilbert–Varshamov bound]

Target entity: Gilbert–Varshamov bound
Context triple: [Hamming bound, comparedWith, Gilbert–Varshamov bound]

• A. 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.
• B. 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.
• C. Golay code
  The Golay code is a highly symmetric, perfect error-correcting code in coding theory, notable for its deep connections to sporadic simple groups, sphere packings, and the Leech lattice.
• D. Wozencraft ensemble in coding theory
  The Wozencraft ensemble in coding theory is a family of randomly constructed linear codes introduced by John Wozencraft that plays a key role in analyzing the performance limits of coding schemes, particularly for achieving capacity on noisy channels.
• E. Slepian–Wolf coding theorem
  The Slepian–Wolf coding theorem is a fundamental result in information theory that characterizes the limits of lossless data compression for correlated sources encoded separately but decoded jointly.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Gilbert–Varshamov bound
Target entity description: 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.

• A. 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.
• B. 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.
• C. Golay code
  The Golay code is a highly symmetric, perfect error-correcting code in coding theory, notable for its deep connections to sporadic simple groups, sphere packings, and the Leech lattice.
• D. Wozencraft ensemble in coding theory
  The Wozencraft ensemble in coding theory is a family of randomly constructed linear codes introduced by John Wozencraft that plays a key role in analyzing the performance limits of coding schemes, particularly for achieving capacity on noisy channels.
• E. Slepian–Wolf coding theorem
  The Slepian–Wolf coding theorem is a fundamental result in information theory that characterizes the limits of lossless data compression for correlated sources encoded separately but decoded jointly.
• F. None of above. chosen