{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:47:47Z","timestamp":1725533267245},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642018138"},{"type":"electronic","value":"9783642018770"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01877-0_21","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T03:01:52Z","timestamp":1244257312000},"page":"259-273","source":"Crossref","is-referenced-by-count":18,"title":["On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Z\u00e9mor","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Hoory, S., Linial, N.: The Moore bound for irregular graphs. Graphs Combin.\u00a018, 53\u201357","DOI":"10.1007\/s003730200002"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"52105","DOI":"10.1063\/1.2731356","volume":"48","author":"H. Bombin","year":"2007","unstructured":"Bombin, H., Martin-Delgado, M.A.: Homological Error Correction: Classical and Quantum Codes. J. Math. Phys.\u00a048, 052105 (2007)","journal-title":"J. Math. Phys."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"A.R. Calderbank","year":"1996","unstructured":"Calderbank, A.R., Shor, P.W.: Good quantum error-correcting codes exist. Phys. Rev. A\u00a054, 1098 (1996)","journal-title":"Phys. Rev. A"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S0963548396002878","volume":"6","author":"L. Decreusefond","year":"1997","unstructured":"Decreusefond, L., Z\u00e9mor, G.: On the error-correcting capabilities of cycle codes of graphs. Combinatorics, Probability and Computing\u00a06, 27\u201338 (1997)","journal-title":"Combinatorics, Probability and Computing"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"4452","DOI":"10.1063\/1.1499754","volume":"43","author":"E. Dennis","year":"2002","unstructured":"Dennis, E., Kitaev, A., Landahl, A., Preskill, J.: Topological quantum memory. J. Math. Phys.\u00a043, 4452\u20134505 (2002)","journal-title":"J. Math. Phys."},{"key":"21_CR6","first-page":"251","volume":"12","author":"P. Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s, P., Sachs, H.: Regul\u00e4re Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe\u00a012, 251\u2013258 (1963)","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe"},{"key":"21_CR7","series-title":"Comput. Math. Ser.","first-page":"287","volume-title":"Mathematics of quantum computation","author":"M.H. Freedman","year":"2002","unstructured":"Freedman, M.H., Meyer, D.A., Luo, F.: F2-systolic freedom and quantum codes. In: Mathematics of quantum computation. Comput. Math. Ser., pp. 287\u2013320. Chapman & Hall\/CRC, Boca Raton (2002)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Hagiwara, M., Imai, H.: Quantum Quasi-Cyclic LDPC Codes. In: Proc. IEEE International Symposium Information Theory (ISIT), Nice 2007, pp. 806\u2013810 (2007)","DOI":"10.1109\/ISIT.2007.4557323"},{"volume-title":"Algebraic Topology","year":"2002","author":"A. Hatcher","key":"21_CR9","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)"},{"key":"21_CR10","unstructured":"Kim, I.H.: Quantum codes on Hurwitz surfaces, S. B. Thesis, MIT (2007), http:\/\/dspace.mit.edu\/handle\/1721.1\/40917"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kitaev, A.: Quantum error correction with imperfect gates. In: Proc. 3rd nt. Conf. of Quantum Communication and Measurement (1997)","DOI":"10.1007\/978-1-4615-5923-8_19"},{"issue":"10","key":"21_CR12","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1109\/TIT.2004.834737","volume":"50","author":"D.J.C. Mackay","year":"2004","unstructured":"Mackay, D.J.C., Mitchison, G., Mcfadden, P.L.: Sparse Graph Codes for Quantum Error-Correction. IEEE Trans. Inform. Theory\u00a050(10), 2315\u20132330 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"G.A. Margulis","year":"1982","unstructured":"Margulis, G.A.: Explicit constructions of graphs without short cycles and low density codes. Combinatorica\u00a02(1), 71\u201378 (1982)","journal-title":"Combinatorica"},{"key":"21_CR14","unstructured":"Preskill, J.: Quantum computation, http:\/\/www.theory.caltech.edu\/~preskill\/ph219"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1112\/plms\/82.3.513","volume":"82","author":"J. \u0160ir\u00e1\u0148","year":"2001","unstructured":"\u0160ir\u00e1\u0148, J.: Triangle group representations and constructions of regular maps. Proc. London Math. Soc.\u00a082(3), 513\u2013532 (2001)","journal-title":"Proc. London Math. Soc."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1098\/rspa.1996.0136","volume":"452","author":"A. Steane","year":"1996","unstructured":"Steane, A.: Multiple particle interference and quantum error correction. Proc. Roy. Soc. Lond. A\u00a0452, 2551 (1996)","journal-title":"Proc. Roy. Soc. Lond. A"},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.nuclphysb.2004.03.006","volume":"686","author":"K. Takeda","year":"2004","unstructured":"Takeda, K., Nishimori, H.: Self-dual random-plaquette gauge model and the quantum toric code. Nuclear Physics B\u00a0686(3), 377\u2013396 (2004)","journal-title":"Nuclear Physics B"},{"issue":"3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1137\/S0895480195292065","volume":"10","author":"J.-P. Tillich","year":"1997","unstructured":"Tillich, J.-P., Z\u00e9mor, G.: Optimal cycle codes constructed from Ramanujan graphs. Siam J. on Discrete Math.\u00a010(3), 447\u2013459 (1997)","journal-title":"Siam J. on Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01877-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:33:38Z","timestamp":1558362818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01877-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642018138","9783642018770"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01877-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}