Pith. sign in

REVIEW 1 cited by

Complex spherical designs and codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1104.4692 v1 pith:BKEF6ATX submitted 2011-04-25 math.CO

classification math.CO
keywords designscomplexrealsphericalassociationcontrastdesignprojective
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Real spherical designs and real and complex projective designs have been shown by Delsarte, Goethals, and Seidel to give rise to association schemes when the strength of the design is high compared to its degree as a code. In contrast, designs on the complex unit sphere remain relatively uninvestigated, despite their importance in numerous applications. In this paper we develop the notion of a complex spherical design and show how many such designs carry the structure of an association scheme. In contrast with the real spherical designs and the real and complex projective designs, these association schemes are nonsymmetric.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A lower bound on the classical simulation cost of star-network correlations

    quant-ph 2026-08 accept novelty 6.0 of 10

    A star-network exclusion game is won perfectly with quantum d-level messages, but classically needs a message of at least n^{d-1} symbols, so no fixed-size classical qubit description can simulate joint measurements o...

Pith tools