English

New self-dual additive $\mathbb{F}_4$-codes constructed from circulant graphs

Combinatorics 2016-11-16 v2 Information Theory math.IT Quantum Physics

Abstract

In order to construct quantum [[n,0,d]][[n,0,d]] codes for (n,d)=(56,15)(n,d)=(56,15), (57,15)(57,15), (58,16)(58,16), (63,16)(63,16), (67,17)(67,17), (70,18)(70,18), (71,18)(71,18), (79,19)(79,19), (83,20)(83,20), (87,20)(87,20), (89,21)(89,21), (95,20)(95,20), we construct self-dual additive F4\mathbb{F}_4-codes of length nn and minimum weight dd from circulant graphs. The quantum codes with these parameters are constructed for the first time.

Keywords

Cite

@article{arxiv.1509.04846,
  title  = {New self-dual additive $\mathbb{F}_4$-codes constructed from circulant graphs},
  author = {Markus Grassl and Masaaki Harada},
  journal= {arXiv preprint arXiv:1509.04846},
  year   = {2016}
}

Comments

11 pages

R2 v1 2026-06-22T10:57:55.362Z