Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
A method for efficiently computing the number of codewords of fixed weights in linear codes
Discrete Applied Mathematics
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper we consider some facts about quantum information, quantum computing and some problems in quantum coding theory. Also, we present an algorithm for constructing linear self-orthogonal codes with good parameters. By this algorithm we construct self-orthogonal codes used to prove the existence of some quantum codes.