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: Bose–Bush construction of orthogonal arrays | Statement: [Raj Chandra Bose, notableWork, Bose–Bush construction of orthogonal arrays]

Target entity: Bose–Bush construction of orthogonal arrays
Context triple: [Raj Chandra Bose, notableWork, Bose–Bush construction of orthogonal arrays]

• A. Hadamard matrices
  Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
• B. The Generalization of Factorial Design
  The Generalization of Factorial Design is a chapter that extends classical factorial experiment methods to more complex and flexible designs, allowing efficient investigation of multiple factors and their interactions.
• C. The Design of Experiments
  The Design of Experiments is a foundational statistics book by Ronald A. Fisher that established modern principles and methods for planning and analyzing scientific experiments.
• 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. 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.
• 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: Bose–Bush construction of orthogonal arrays
Triple: [Raj Chandra Bose, notableWork, Bose–Bush construction of orthogonal arrays]

The Bose–Bush construction of orthogonal arrays is a foundational combinatorial method that systematically builds highly structured experimental designs and error-correcting codes with strong balance and symmetry properties.

Target entity: Bose–Bush construction of orthogonal arrays
Target entity description: The Bose–Bush construction of orthogonal arrays is a foundational combinatorial method that systematically builds highly structured experimental designs and error-correcting codes with strong balance and symmetry properties.

• A. Hadamard matrices
  Hadamard matrices are square matrices with entries ±1 whose rows are mutually orthogonal, playing a key role in combinatorics, coding theory, and signal processing.
• B. The Generalization of Factorial Design
  The Generalization of Factorial Design is a chapter that extends classical factorial experiment methods to more complex and flexible designs, allowing efficient investigation of multiple factors and their interactions.
• C. The Design of Experiments
  The Design of Experiments is a foundational statistics book by Ronald A. Fisher that established modern principles and methods for planning and analyzing scientific experiments.
• 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. 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.
• F. None of above. chosen