New self-dual additive F4-codes constructed from circulant graphs

Markus Grassl, Masaaki Harada

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


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 F4-codes of length n and minimum weight d from circulant graphs. The quantum codes with these parameters are constructed for the first time.

Original languageEnglish
Pages (from-to)399-403
Number of pages5
JournalDiscrete Mathematics
Issue number3
Publication statusPublished - 2017 Mar 1


  • Additive F-code
  • Circulant graph
  • Quantum code
  • Self-dual code

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'New self-dual additive F4-codes constructed from circulant graphs'. Together they form a unique fingerprint.

Cite this