Conjugate Codes for Secure and Reliable Information Transmission

A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is known that conjugate code pairs are applicable to (quantum) cryptography. In this work, polynomially constructible and efficiently decodable conjugate code pairs are presented. The constructed pairs achieve the highest known achievable rate on additive channels.

[1]  M. Hamada,et al.  Algebraic and quantum theoretical approach to coding on wiretap channels , 2008, 2008 3rd International Symposium on Communications, Control and Signal Processing.

[2]  Shor,et al.  Simple proof of security of the BB84 quantum key distribution protocol , 2000, Physical review letters.

[3]  Shor,et al.  Good quantum error-correcting codes exist. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  M. Hamada.  Concatenated Conjugate Codes , 2006, quant-ph/0610194.

[6]  H. Stichtenoth,et al.  On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .

[7]  M. Hamada.  Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction , 2008, IEEE Transactions on Information Theory.

[8]  Mitsuru Hamada,et al.  Quotient Codes and Their Reliability , 2005 .

[9]  O. F. Cook.  The Method of Types , 1898 .

[10]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[11]  S. Litsyn,et al.  Asymptotically Good Quantum Codes , 2000, quant-ph/0006061.

[12]  Mitsuru Hamada,et al.  Conjugate codes and applications to cryptography , 2006 .

[13]  Philippe Piret,et al.  Algebraic constructions of Shannon codes for regular channels , 1982, IEEE Trans. Inf. Theory.

[14]  Mitsuru Hamada.  Reliability of Calderbank-Shor-Steane codes and security of quantum key distribution , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[15]  Mitsuru Hamada,et al.  Constructive Conjugate Codes for Quantum Error Correction and Cryptography , 2007, ArXiv.

[16]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[17]  Kenneth W. Shum,et al.  A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound , 2001, IEEE Trans. Inf. Theory.

[18]  Hao Chen,et al.  Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound , 2001, IEEE Trans. Inf. Theory.

[19]  D. Mayers,et al.  Shor and Preskill's and Mayers's security proof for the BB84 quantum key distribution protocol , 2002 .

[20]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.