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

On asymmetric error-correcting codes

Robert Stephen Cunningham

Published Mar 1, 1982• 1 citation
OpenAlex

Related papers

Some Features of Linear Codes that Correct Asymmetric Errors

R. R. Varshamov

Soviet physics. Doklady•Jan 1, 1965•12 citations

Bounds and constructions for binary block codes correcting asymmetric or unidirectional errors

Jos H. Weber

•Nov 23, 1989•13 citations

The theory of error-correcting codes

James L. Massey

Proceedings of the IEEE•Jan 1, 1980•722 citations

基于经典Goppa 码的非对称量子稳定子码构造

Yue RAN, Juan XU, Hanwu Chen +2 more

Since Calderbank et al. established CRSS construction, which constructs quantum error-correcting codes (QECC) from classical error-correcting codes, many QECC demonstrating good performance have been constructed from classical error-correcting codes; these codes are referred to as quantum stabilizer codes. Recent physical experiments indicate that the probabilities of occurrence of qubit- ip errors are much less than those of phase- ip errors in most quantum mechanical systems. Error-correcting codes thus constructed are referred to as asymmetric quantum codes. In this paper, series of asymmetric quantum stabilizer codes are constructed using nested Goppa codes and dual contained Goppa codes. In the construction of asymmetric quantum codes based on nested Goppa codes, the choice of Goppa codes is limited to construct codes with analysis methods. In normal circumstances, the construction is executed with the help of mathematical software Matlab, which is used to compute the minimum distance of Goppa codes. In the construction of asymmetric quantum codes based on dual contained Goppa codes, the error correction ability of the codes constructed in this paper is re ected in the correction of Z-type errors

Scientia Sinica Informationis•Mar 1, 2013•0 citations

On asymmetric quantum error-correcting codes

Martianus Frederic Ezerman

This thesis focuses on the construction and analysis of the parameters of asymmetric quantum error-correcting codes (AQECCs). We use the so-called functional approach to connect AQECCs to classical codes via orthogonal arrays. Based on the functional approach, we derive pure AQECCs from CSS-like constructions that include the standard CSS construction known prior to this work. The CSS-like constructions remove both the specific choice of Euclidean inner product and the $\F_{q}$-linearity condition imposed by the standard variant. Hence, pure AQECCs can now be constructed by using pairs of nested $\F_{r}$-linear codes over $\F_{q}$ where $\F_{r}$ is any subfield of $\F_{q}$ under the Euclidean, trace Euclidean, Hermitian, and trace Hermitian inner products. Relationships between the various CSS-like constructions are also exhibited. A formal definition of asymmetric stabilizer codes is given and a connection between pure asymmetric stabilizer codes and AQECCs derived from the CSS-like constructions is established. It is shown that the class of pure CSS-like AQECCs forms a subset of asymmetric stabilizer codes. We show how classical linear MDS codes can be used to construct AQECCs that satisfy the quantum Singleton bound with $d_{z} \geq d_{x}\geq 2$ for all possible values of length $n$ for which linear MDS codes over $\F_{q}$ are known to exist. Beyond the lengths specified by the classical MDS conjecture, various explicit constructions of nested pairs of classical codes can be combined with linear programming to establish the optimality of pure CSS-like codes with parameters $[[n,k,d_{z}/d_{x}]]_{q}$. For $q=\{2,3,4,5,7,8,9\}$, lists of optimal asymmetric CSS-like codes for reasonable lengths are presented.

•Jan 1, 2011•3 citations

Bounds for error-correcting codes (Corresp.)

W. W. Peterson

IEEE Transactions on Information Theory•Jan 1, 1962•2 citations
Since Calderbank et al. established CRSS construction, which constructs quantum error-correcting codes (QECC) from classical error-correcting codes, many QECC demonstrating good performance have been constructed from classical error-correcting codes; these codes are referred to as quantum stabilizer codes. Recent physical experiments indicate that the probabilities of occurrence of qubit- ip errors are much less than those of phase- ip errors in most quantum mechanical systems. Error-correcting codes thus constructed are referred to as asymmetric quantum codes. In this paper, series of asymmetric quantum stabilizer codes are constructed using nested Goppa codes and dual contained Goppa codes. In the construction of asymmetric quantum codes based on nested Goppa codes, the choice of Goppa codes is limited to construct codes with analysis methods. In normal circumstances, the construction is executed with the help of mathematical software Matlab, which is used to compute the minimum distance of Goppa codes. In the construction of asymmetric quantum codes based on dual contained Goppa codes, the error correction ability of the codes constructed in this paper is re ected in the correction of Z-type errors
This thesis focuses on the construction and analysis of the parameters of asymmetric quantum error-correcting codes (AQECCs). We use the so-called functional approach to connect AQECCs to classical codes via orthogonal arrays. Based on the functional approach, we derive pure AQECCs from CSS-like constructions that include the standard CSS construction known prior to this work. The CSS-like constructions remove both the specific choice of Euclidean inner product and the $\F_{q}$-linearity condition imposed by the standard variant. Hence, pure AQECCs can now be constructed by using pairs of nested $\F_{r}$-linear codes over $\F_{q}$ where $\F_{r}$ is any subfield of $\F_{q}$ under the Euclidean, trace Euclidean, Hermitian, and trace Hermitian inner products. Relationships between the various CSS-like constructions are also exhibited. A formal definition of asymmetric stabilizer codes is given and a connection between pure asymmetric stabilizer codes and AQECCs derived from the CSS-like constructions is established. It is shown that the class of pure CSS-like AQECCs forms a subset of asymmetric stabilizer codes. We show how classical linear MDS codes can be used to construct AQECCs that satisfy the quantum Singleton bound with dz≥dx≥2d_{z} \geq d_{x}\geq 2dz​≥dx​≥2 for all possible values of length nnn for which linear MDS codes over $\F_{q}$ are known to exist. Beyond the lengths specified by the classical MDS conjecture, various explicit constructions of nested pairs of classical codes can be combined with linear programming to establish the optimality of pure CSS-like codes with parameters [[n,k,dz/dx]]q[[n,k,d_{z}/d_{x}]]_{q}[[n,k,dz​/dx​]]q​. For q={2,3,4,5,7,8,9}q=\{2,3,4,5,7,8,9\}q={2,3,4,5,7,8,9}, lists of optimal asymmetric CSS-like codes for reasonable lengths are presented.