New self-dual additive mathbb{F}₄-codes constructed from circulant graphs
classification
🧮 math.CO
cs.ITmath.ITquant-ph
keywords
codesadditivecirculantconstructconstructedgraphsmathbbquantum
read the original abstract
In order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive $\mathbb{F}_4$-codes of length $n$ and minimum weight $d$ from circulant graphs. The quantum codes with these parameters are constructed for the first time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.