Minimum Distance of Concatenated Conjugate Codes for Cryptography and Quantum Error Correction
暂无分享,去创建一个
[1] Chaoping Xing,et al. Asymptotic bounds on quantum codes from algebraic geometry codes , 2006, IEEE Transactions on Information Theory.
[2] J. H. Lint,et al. Algebraic-geometric codes , 1992 .
[3] Alexei E. Ashikhmin,et al. Nonbinary quantum stabilizer codes , 2001, IEEE Trans. Inf. Theory.
[4] H. Stichtenoth,et al. A low complexity algorithm for the construction of algebraic geometric codes better than the Gilbert-Varshamov bound , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[5] V. D. Goppa. Codes on Algebraic Curves , 1981 .
[6] Andrew M. Steane. Enlargement of Calderbank-Shor-Steane quantum codes , 1999, IEEE Trans. Inf. Theory.
[7] Henning Stichtenoth. Transitive and Self-dual Codes Attaining the Tsfasman-Vladut-Zink Bound , 2005 .
[8] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[9] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[10] Shor,et al. Simple proof of security of the BB84 quantum key distribution protocol , 2000, Physical review letters.
[11] Shor,et al. Good quantum error-correcting codes exist. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[12] Gérard D. Cohen,et al. On binary constructions of quantum codes , 1999, IEEE Trans. Inf. Theory.
[13] Rudolf Lide,et al. Finite fields , 1983 .
[14] A. Steane. Multiple-particle interference and quantum error correction , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[15] M. Hamada. Concatenated Conjugate Codes , 2006, quant-ph/0610194.
[16] Mitsuru Hamada. NOTES ON THE FIDELITY OF SYMPLECTIC QUANTUM ERROR-CORRECTING CODES , 2003 .
[17] H. Stichtenoth,et al. On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .
[18] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[19] Ryutaroh Matsumoto,et al. Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes , 2002, Proceedings IEEE International Symposium on Information Theory,.
[20] Mitsuru Hamada. Reliability of Calderbank-Shor-Steane codes and security of quantum key distribution , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[21] S. Litsyn,et al. Asymptotically Good Quantum Codes , 2000, quant-ph/0006061.
[22] Hao Chen,et al. Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound , 2001, IEEE Trans. Inf. Theory.
[23] H. Stichtenoth,et al. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .
[24] Tom Høholdt,et al. An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound: The first steps , 1997, IEEE Trans. Inf. Theory.
[25] Abraham Lempel,et al. Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields , 1980, SIAM J. Comput..
[26] Mitsuru Hamada,et al. Quotient Codes and Their Reliability , 2005 .