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: extended binary Golay code | Statement: [Leech lattice, constructedFrom, extended binary Golay code]

Target entity: extended binary Golay code
Context triple: [Leech lattice, constructedFrom, extended binary Golay code]

• A. 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.
• B. Reed–Solomon codes
  Reed–Solomon codes are a class of powerful error-correcting codes based on polynomial evaluation over finite fields, widely used in digital communications and data storage to detect and correct multiple symbol errors.
• C. 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.
• 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. 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.
• 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: extended binary Golay code
Triple: [Leech lattice, constructedFrom, extended binary Golay code]

The extended binary Golay code is a famous 24-bit error-correcting code with exceptional symmetry and optimal properties, central to constructions in coding theory and lattice theory such as the Leech lattice.

Target entity: extended binary Golay code
Target entity description: The extended binary Golay code is a famous 24-bit error-correcting code with exceptional symmetry and optimal properties, central to constructions in coding theory and lattice theory such as the Leech lattice.

• A. 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.
• B. Reed–Solomon codes
  Reed–Solomon codes are a class of powerful error-correcting codes based on polynomial evaluation over finite fields, widely used in digital communications and data storage to detect and correct multiple symbol errors.
• C. 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.
• 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. 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.
• F. None of above. chosen