{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:46:04Z","timestamp":1729676764862,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513687","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"1130-1132","source":"Crossref","is-referenced-by-count":3,"title":["Good codes from generalised algebraic geometry codes"],"prefix":"10.1109","author":[{"given":"Mubarak","family":"Jibril","sequence":"first","affiliation":[]},{"given":"Martin","family":"Tomlinson","sequence":"additional","affiliation":[]},{"given":"Mohammed Zaki","family":"Ahmed","sequence":"additional","affiliation":[]},{"given":"Cen","family":"Tjhai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"2638","DOI":"10.1109\/18.887873","article-title":"Some new codes from algebraic curves","volume":"46","author":"ding","year":"2000","journal-title":"Information Theory IEEE Transactions on"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909125"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"article-title":"Manypoints: A table of curves with many points","year":"0","author":"van der geer","key":"ref14"},{"article-title":"Curves with many points","year":"2001","author":"shabat","key":"ref15"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-6870-8","author":"goppa","year":"1988","journal-title":"Geometry and Codes"},{"article-title":"Mint: A database for optimal net parameters","year":"2004","author":"schimd","key":"ref3"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/s002000050111","article-title":"A new construction of algebraic-geometry codes","volume":"9","author":"niederreiter","year":"1999","journal-title":"Appl Algebra Engrg Comm Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.761259"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.796390"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.796391"},{"article-title":"Bounds on the minimum distance of linear codes and quantum codes","year":"2007","author":"grassl","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19821090103"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.971757"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513687.pdf?arnumber=5513687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:53:32Z","timestamp":1497862412000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513687\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513687","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}