Plotkin bound

Target entity: Plotkin bound
Context triple: [Hamming bound, comparedWith, Plotkin 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. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• D. 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.
• E. Hoffman bound in graph theory
  The Hoffman bound in graph theory is a spectral bound that uses the eigenvalues of a graph’s adjacency matrix to give an upper limit on the size of its maximum independent set (and related parameters like the chromatic number).
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Plotkin bound
Target entity description: 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.

• 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. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• D. 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.
• E. Hoffman bound in graph theory
  The Hoffman bound in graph theory is a spectral bound that uses the eigenvalues of a graph’s adjacency matrix to give an upper limit on the size of its maximum independent set (and related parameters like the chromatic number).
• F. None of above. chosen