{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:50:25Z","timestamp":1729669825554,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874962","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"896-900","source":"Crossref","is-referenced-by-count":1,"title":["Constructions of pure asymmetric quantum alternant codes based on subclasses of Alternant codes"],"prefix":"10.1109","author":[{"given":"Jihao","family":"Fan","sequence":"first","affiliation":[]},{"given":"Hanwu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046221"},{"key":"17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1011281431366","article-title":"True dimension of some binary quadratic trace Goppa codes","volume":"24","author":"ve?ron","year":"2001","journal-title":"Designs Codes and Cryptography"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-004-1722-4"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2008.0439"},{"key":"16","first-page":"98","article-title":"A subclass of binary Goppa codes","volume":"25","author":"shekhunova","year":"1989","journal-title":"Probl Peredachi Inf"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1981","author":"macwilliams","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.75251"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-011-0269-3"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056946"},{"key":"3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1008252303768","article-title":"A subclass of binary Goppa codes with improved estimation of the code dimension","volume":"14","author":"bezzateev","year":"1998","journal-title":"Designs Codes and Cryptography"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.370170"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.63.032311"},{"journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes","year":"2007","author":"grassl","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9885-5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272575"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620361"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.032310"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.040301"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159040"}],"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\/06874962.pdf?arnumber=6874962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T14:39:38Z","timestamp":1602686378000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874962","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}