{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:53:37Z","timestamp":1730274817052,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875000","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"1086-1090","source":"Crossref","is-referenced-by-count":2,"title":["Numerical techniques for finding the distances of quantum codes"],"prefix":"10.1109","author":[{"given":"Ilya","family":"Dumer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey A.","family":"Kovalev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid P.","family":"Pryadko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Homological Product Codes","year":"2013","author":"bravyi","key":"19"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/18.904512"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.012311"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312605"},{"journal-title":"New Constructions of CSS Codes Obtained by Moving to Higher Alphabets","year":"2012","author":"andriyanova","key":"18"},{"journal-title":"Probabilistic Methods in Combinatorics","year":"1974","author":"erdos","key":"33"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205648"},{"key":"34","first-page":"24","article-title":"Two decoding algorithms for linear codes","volume":"25","author":"dumer","year":"1989","journal-title":"Probl Peredachi Inf"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284206"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834737"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.020304"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.104.050503"},{"journal-title":"A Proposed Quantum Low Density Parity Check Code","year":"2001","author":"postol","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/18.681315"},{"journal-title":"Information Theory Inference and Learning Algorithms","year":"2003","author":"mackay","key":"22"},{"key":"23","first-page":"987","article-title":"On the iterative decoding of sparse quantum codes","volume":"8","author":"poulin","year":"2008","journal-title":"Quant Inf and Comp"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2167593"},{"key":"25","first-page":"3","article-title":"Complexity of decoding for linear codes","volume":"19","author":"evseev","year":"1983","journal-title":"Probl Peredachi Inf"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/18.556688"},{"key":"27","article-title":"Integral Hecke modules, integral generalized Reed-Muller codes, and linear codes","author":"zimmermann","year":"1996","journal-title":"Technische Universit at Hamburg- Harburg Tech Rep Tech Rep 3-96"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261958"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.3824"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.55.900"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.090501"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/18.21270"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.012305"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.97.180501"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/18.57202"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1063\/1.1499754"},{"key":"31","first-page":"103","article-title":"Decoding complexity bound for linear block codes","volume":"25","author":"kruk","year":"1989","journal-title":"Probl Peredachi Inf"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.98.190504"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1063\/1.2731356"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875000.pdf?arnumber=6875000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:23:10Z","timestamp":1602674590000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875000","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}