A construction of quantum LDPC codes from Cayley graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2013

A construction of quantum LDPC codes from Cayley graphs

Résumé

We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi in the draft [6]. It is based on the Cayley graph of F_2^n together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We give a general lower bound on the minimum distance of the quantum code in O(dn^2) where d is the minimum distance of the classical code. When the classical code is the [n; 1; n] repetition code, we are able to compute the exact parameters of the associated quantum code which are [[2^{n-1}, 2^{n/2}, 2^{n/2-1}]].
Fichier principal
Vignette du fichier
v3_Long_Cayley.pdf (298.83 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00632257 , version 1 (13-10-2011)
hal-00632257 , version 2 (12-06-2012)
hal-00632257 , version 3 (07-03-2013)
hal-00632257 , version 4 (13-12-2013)

Identifiants

Citer

Alain Couvreur, Nicolas Delfosse, Gilles Zemor. A construction of quantum LDPC codes from Cayley graphs. IEEE Transactions on Information Theory, 2013, 59 (9), pp.6087-6098. ⟨10.1109/TIT.2013.2261116⟩. ⟨hal-00632257v4⟩
362 Consultations
372 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More