CSS-like Constructions of Asymmetric Quantum Codes

P. Delsarte, “Bounds for unrestricted codes by linear programming,” Phillips Research Report , vol. 27, pp. 47–64, 1972

1972

Earlier work this paper cites.

P. Delsarte, “Four fundamental parameters of a code and their combinatorial significance,” Information and Control , vol. 23, pp. 407–438, 1973

1973

Earlier work this paper cites.

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes . Amsterdam: North-Holland, 1977

1977

Earlier work this paper cites.

A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A , vol. 54, pp. 1098–1105, Aug. 1996

1996

Earlier work this paper cites.

A. M. Steane, “Multiple particle interference and quantum error correction,” Proc. of the Royal Soc. A , vol. 452, pp. 2551-2577, 1996

1996

Earlier work this paper cites.

W. Bosma, J. Cannon, and C. Playoust, “The Magma algebra system. I. The user language,” J. Symbolic Comput. , vol. 24, no. 3-4, pp. 235–265, 1997

1997

Earlier work this paper cites.

R. Lidl and H. Niederreiter, Finite Fields , Encyclopedia of Mathematics and its Applications vol. 20. Cambridge: Cambridge Univ. Press, 1997

1997

Earlier work this paper cites.

A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over G ​ F ​ ( 4 ) GF(4) ,” IEEE Trans. Inf. Theory , vol. 44, pp. 1369–1387, Jul. 1998

1998

Earlier work this paper cites.

A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal Arrays, Theory and Applications . New York: Springer-Verlag, 1999

1999

Earlier work this paper cites.

E. M. Rains, “Nonbinary quantum codes,” IEEE Trans. Inf. Theory , vol. 45, pp. 1827–1832, Sep. 1999

1999

Earlier work this paper cites.

C. Ding, D. R. Kohel, and S. Ling, “Elementary 2 2 -group character codes,” IEEE Trans. Inf. Theory , vol. 46, pp. 280–284, Jan. 2000

2000

Earlier work this paper cites.

G. T. Bogdanova, A. E. Brouwer, S. N. Kapralov, and P. R. J. Östergård, “Error-correcting codes over an alphabet of four elements,” Designs, Codes and Cryptography , vol. 23, pp. 333–342, 2001

2001

Cited alongside, same era.

W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes . Cambridge: Cambridge Univ. Press, 2003

2003

Cited alongside, same era.

S. Ling, “A family of group character codes,” European J. of Combinatorics , vol. 25, pp. 579–590, 2004

2004

Cited alongside, same era.

K. Feng, S. Ling, and C. Xing, “Asymptotic bounds on quantum codes from algebraic geometry codes,” IEEE Trans. Inf. Theory , vol. 52, pp. 986–991, Mar. 2006

2006

Cited alongside, same era.

A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, “Nonbinary stabilizer codes over finite fields,” IEEE Trans. Inf. Theory , vol. 52, pp. 4892–4914, Nov. 2006

2006

M. Grassl and T. A. Gulliver, “On circulant self-dual codes over small fields,” Designs, Codes and Cryptography , vol. 52, pp. 57–81, 2009

2009

Later among the works it cites.

P. K. Sarvepalli, A. Klappenecker, and M. Rötteler, “Asymmetric quantum codes: Constructions, bounds and performance,” Proc. of the Royal Soc. A , vol. 465, pp. 1645–1672, 2009

2009

Later among the works it cites.

S. A. Aly and A. Ashikhmin, “Nonbinary quantum cyclic and subsystem codes over asymmetrically-decohered quantum channels,” IEEE Information Theory Workshop (ITW) 2010 , pp. 1–5, Jan. 2010

2010

Later among the works it cites.

S. Jitman, S. Ling, H. Liu, and X. Xie, “Checkable codes from group rings,” preprint, 2010 [Online]. Available: http://arxiv.org/pdf/1012.5498

Original

2010

Later among the works it cites.

M. F. Ezerman, S. Ling, and P. Solé, “Additive asymmetric quantum codes,” IEEE Trans. Inf. Theory , vol. 57, pp. 5536–5550, Aug. 2011