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

Bulletin of the Korean Mathematical Society

QUANTUM CODES WITH IMPROVED MINIMUM DISTANCE

Emre Kolotoğlu, Mustafa Sarı

Published Jan 1, 2019• 0 citations
Publisher
DOI
10.4134/bkms.b180295

Related papers

Quantum codes with bounded minimum distance

Carlos Galindo, Fernando Hernando, Diego Ruano

•Jan 1, 2015•1 citation

LINEAR QUANTUM CODES OF MINIMUM DISTANCE THREE

Ruihu Li, Xueliang Li, Zongben Xu

We give elementary recursive constructions of quaternary self-orthogonal codes with dual distance three for all n ≥ 5. Consequently, good linear quantum codes of minimum distance three for such length n are obtained. Almost all of these linear quantum codes are optimal or near optimal.

International Journal of Quantum Information•Dec 1, 2006•5 citations

TERNARY QUANTUM CODES OF MINIMUM DISTANCE THREE

Jian Liu

Based on finite field and combinatorics theory, an elementary recursive construction is used to construct Hermitian self-orthogonal codes over 𝔽9, the Galois field with nine elements, with dual distance three for all n ≥ 4. Consequently, good ternary linear quantum codes of minimum distance three for such length n are obtained. These ternary linear quantum codes are optimal or near optimal according to the quantum Singleton bound and quantum Hamming bound.

International Journal of Quantum Information•Oct 1, 2010•6 citations

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•0 citations

AN IMPROVED ITERATIVE DECODING ALGORITHM OF RATE-COMPATIBLE PUNCTURED LDPC CODES

Gou Hosoya

Far East Journal of Electronics and Communications•Sep 14, 2015•0 citations

Quantum codes from trace codes

Pavan Kumar, Noor Mohammad Khan

Journal of Applied Mathematics and Computing•Oct 23, 2022•0 citations