Constructs minimal ((4,q,2))_q permutation-invariant qudit codes for every q >= 2 via edge-colorings of K_q and proves no such codes exist for n <= 3.
Permutation-invariant quantum coding for quantum dele- tion channels,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2representative citing papers
Derives closed-form MacWilliams matrix for permutation-invariant qudit codes as Racah polynomials with parameters set by block length and dimension.
citing papers explorer
-
Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs
Constructs minimal ((4,q,2))_q permutation-invariant qudit codes for every q >= 2 via edge-colorings of K_q and proves no such codes exist for n <= 3.
-
Orthogonal Polynomials and the MacWilliams Transform for Permutation-Invariant Qudit Codes
Derives closed-form MacWilliams matrix for permutation-invariant qudit codes as Racah polynomials with parameters set by block length and dimension.