Phantom codes obey the bound k ≤ log₂(n+1) except for a constructed (8, 2^4, 2) example at k=4, following from a general theorem linking code length to automorphism group structure.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constraints on phantom codes from automorphism group bounds
Phantom codes obey the bound k ≤ log₂(n+1) except for a constructed (8, 2^4, 2) example at k=4, following from a general theorem linking code length to automorphism group structure.