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

东北数学:英文版

A New Description of the Additive Quantum Codes

唐黎明, 刘焕平, 吕学琴

Published Jan 1, 2006• 0 citations
OpenAlex

Related papers

A new description of quantum error-correcting codes

Wen-Ching Li

AMS/IP studies in advanced mathematics•Jul 20, 2007•0 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

New quantum codes from constacyclic and additive constacyclic codes

Habibul Islam, Om Prakash

Quantum Information Processing•Aug 28, 2020•44 citations

Additive twisted codes: new distance bounds and infinite families of quantum codes

Reza Dastbasteh, Petr Lisoněk

Designs Codes and Cryptography•Jan 16, 2025•0 citations

New non-binary quantum codes from skew constacyclic and additive skew constacyclic codes

Ram Krishna Verma, Om Prakash, Habibul Islam +1 more

The European Physical Journal Plus•Feb 1, 2022•10 citations

Puncturing Quantum Stabilizer Codes

Jaron Skovsted Gundersen, René Bødker Christensen, Markus Grassl +2 more

Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. Both of these techniques have been generalized to quantum codes. Restricting to stabilizer codes, this paper introduces more freedom in the choice of the encoded states after puncturing. Furthermore, we also give an explicit description of the stabilizers for the punctured code. The additional freedom in the procedure also opens up for new ways to construct new codes from old, and we present several ways to utilize this in the search for codes with good or even optimal parameters. In particular, we use the construction to obtain codes whose parameters exceed the best previously known and which are better than what general puncturing guarantees. Lastly, the freedom in our puncture procedure allowed us to generalize the proof of the Griesmer bound from the classical setting to stabilizer codes for qudits of prime dimension since the proof relies heavily on the puncturing technique.

arXiv:2410.17754•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2025•5 citations
Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. Both of these techniques have been generalized to quantum codes. Restricting to stabilizer codes, this paper introduces more freedom in the choice of the encoded states after puncturing. Furthermore, we also give an explicit description of the stabilizers for the punctured code. The additional freedom in the procedure also opens up for new ways to construct new codes from old, and we present several ways to utilize this in the search for codes with good or even optimal parameters. In particular, we use the construction to obtain codes whose parameters exceed the best previously known and which are better than what general puncturing guarantees. Lastly, the freedom in our puncture procedure allowed us to generalize the proof of the Griesmer bound from the classical setting to stabilizer codes for qudits of prime dimension since the proof relies heavily on the puncturing technique.