Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Symbolic Computation

Formally self-dual additive codes over F4

Sunghyu Han, Jon-Lark Kim

Published Mar 26, 2010• 12 citations
Publisher
DOI
10.1016/j.jsc.2010.03.011

Related papers

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

Markus Grassl, Masaaki Harada

arXiv:1509.04846•Discrete Mathematics•Nov 14, 2016•11 citations

New quantum codes constructed from some self-dual additive F4 -codes

Masaaki Harada

arXiv:1805.12229•Information Processing Letters•May 30, 2018•6 citations

On the classification of all self-dual additive codes over GF(4) of length up to 12

Lars Eirik Danielsen, Matthew Geoffrey Parker

arXiv:math/0504522•Journal of Combinatorial Theory Series A•Jan 11, 2006•83 citations

Double quadratic residue codes and self-dual double cyclic codes

Arezoo Soufi Karbaski, Taher Abualrub, Steven T. Dougherty

Applicable Algebra in Engineering Communication and Computing•May 29, 2020•1 citation

Triorthogonal codes and self-dual codes

Minjia Shi, Haodong Lu, Jon-Lark Kim +1 more

arXiv:2408.09685•Quantum Information Processing•Jul 20, 2024•3 citations

Improved Quantum Codes from Metacirculant Graphs via Self-Dual Additive $\mathbb{F}_4$-Codes

Padmapani Seneviratne, Martianus Frederic Ezerman

We use symplectic self-dual additive codes over $\mathbb{F}_4$ obtained from metacirculant graphs to construct, for the first time, $[[\ell, 0, d ]]$ qubit codes with parameters $(\ell,d) \in \{(78, 20), (90, 21), (91, 22), (93,21),(96,21)\}$. Secondary constructions applied to the qubit codes result in many qubit codes that perform better than the previous best-known.

arXiv:2105.12685•May 26, 2021•0 citations
Improved Quantum Codes from Metacirculant Graphs via Self-Dual Additive F4\mathbb{F}_4F4​-Codes
We use symplectic self-dual additive codes over F4\mathbb{F}_4F4​ obtained from metacirculant graphs to construct, for the first time, [[ℓ,0,d]][[\ell, 0, d ]][[ℓ,0,d]] qubit codes with parameters (ℓ,d)∈{(78,20),(90,21),(91,22),(93,21),(96,21)}(\ell,d) \in \{(78, 20), (90, 21), (91, 22), (93,21),(96,21)\}(ℓ,d)∈{(78,20),(90,21),(91,22),(93,21),(96,21)}. Secondary constructions applied to the qubit codes result in many qubit codes that perform better than the previous best-known.