A construction of quantum LDPC codes from Cayley graphs
| hal.structure.identifier | Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX] | |
| hal.structure.identifier | Geometry, arithmetic, algorithms, codes and encryption [GRACE] | |
| dc.contributor.author | COUVREUR, Alain | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | DELFOSSE, Nicolas | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | ZEMOR, Gilles | |
| dc.date.accessioned | 2024-04-04T02:20:41Z | |
| dc.date.available | 2024-04-04T02:20:41Z | |
| dc.date.created | 2013-02-25 | |
| dc.date.issued | 2013-09 | |
| dc.identifier.issn | 0018-9448 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/189514 | |
| dc.description.abstractEn | 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}]]. | |
| dc.language.iso | en | |
| dc.publisher | Institute of Electrical and Electronics Engineers | |
| dc.title.en | A construction of quantum LDPC codes from Cayley graphs | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1109/TIT.2013.2261116 | |
| dc.subject.hal | Mathématiques [math]/Théorie de l'information et codage [math.IT] | |
| dc.subject.hal | Informatique [cs]/Théorie de l'information [cs.IT] | |
| bordeaux.journal | IEEE Transactions on Information Theory | |
| bordeaux.page | 6087-6098 | |
| bordeaux.volume | 59 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 9 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00632257 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00632257v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=IEEE%20Transactions%20on%20Information%20Theory&rft.date=2013-09&rft.volume=59&rft.issue=9&rft.spage=6087-6098&rft.epage=6087-6098&rft.eissn=0018-9448&rft.issn=0018-9448&rft.au=COUVREUR,%20Alain&DELFOSSE,%20Nicolas&ZEMOR,%20Gilles&rft.genre=article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||