Constructive Conjugate Codes for Quantum Error Correction and Cryptography
| dc.creator | Hamada, Mitsuru | |
| dc.date | 2007-03-28 | |
| dc.date | 2007-03-29 | |
| dc.date.accessioned | 2026-07-07T08:17:09Z | |
| dc.date.available | 2026-07-07T08:17:09Z | |
| dc.description | 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 error-correcting code. It is known that conjugate code pairs are applicable to quantum cryptography. In this work, a polynomial construction of conjugate code pairs is presented. The constructed pairs achieve the highest known achievable rate on additive channels, and are decodable with algorithms of polynomial complexity. | |
| dc.description | 10 pages, 1 figure. Ver.2: statement in Theorem 7.1 was revised to a more general one, which the proof (unchanged except a couple of lines after Eq.(11)) had really implied. A corollary to this theorem was added. Annotative parts on achievable rates (mainly after the proof of Theorem 7.1) were revised | |
| dc.identifier | https://arxiv.org/abs/cs/0703141 | |
| dc.identifier | http://arxiv.org/abs/cs/0703141 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134027 | |
| dc.subject | Information Theory | |
| dc.title | Constructive Conjugate Codes for Quantum Error Correction and Cryptography | |
| dc.type | text |