{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:28:26Z","timestamp":1729636106123,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205647","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"794-798","source":"Crossref","is-referenced-by-count":0,"title":["A polynomial-time construction of self-orthogonal codes and applications to quantum error correction"],"prefix":"10.1109","author":[{"given":"Mitsuru","family":"Hamada","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.56.76"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860824"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/18.796388"},{"journal-title":"Stabilizer codes and quantum error correction","year":"1997","author":"gottesman","key":"18"},{"key":"15","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/18.567659","article-title":"an explicit construction of a sequence of codes attaining the tsfasman-vladut-zink bound the first step","volume":"43","author":"vossand","year":"1997","journal-title":"IEEE Trans Information Theory"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.681315"},{"journal-title":"A Low-Complexity Construction of Algebraic Geometric Codes Better Than the Gilbert-Varshamov Bound","year":"2000","author":"shum","key":"13"},{"key":"14","doi-asserted-by":"crossref","first-page":"2566","DOI":"10.1109\/18.945271","article-title":"finding the defining functions for one-point algebraicgeometry codes","volume":"47","author":"leonard","year":"0","journal-title":"IEEE Trans Information Theory"},{"key":"11","doi-asserted-by":"crossref","first-page":"2225","DOI":"10.1109\/18.945244","article-title":"a low-complexity algorithm for the construction of algebraicgeometric codes better than the gilbert-varshamov bound","volume":"47","author":"shum","year":"0","journal-title":"IEEE Trans Information Theory"},{"key":"12","doi-asserted-by":"crossref","first-page":"767","DOI":"10.17323\/1609-4514-2005-5-4-767-774","article-title":"some artin-schreier towers are easy","volume":"5","author":"garcia","year":"2005","journal-title":"Moscow Math J"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862086"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872986"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/18.959288"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006416"},{"year":"0","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"article-title":"several classes of concatenated quantum codes: constructions and bounds","year":"2006","author":"fujita","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013156"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4785-3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3810-9"},{"journal-title":"Algebraic Function Fields and Codes","year":"1993","author":"stichtenoth","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.930941"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205647.pdf?arnumber=5205647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:35:55Z","timestamp":1558485355000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205647\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205647","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}