{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:11:14Z","timestamp":1761718274754},"reference-count":8,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/tit.2013.2276626","type":"journal-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T18:01:15Z","timestamp":1375466475000},"page":"7299-7304","source":"Crossref","is-referenced-by-count":6,"title":["A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes"],"prefix":"10.1109","volume":"59","author":[{"given":"Martin","family":"Tomlinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mubarak","family":"Jibril","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cen","family":"Tjhai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey V.","family":"Bezzateev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Grassl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Zaki","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055610"},{"key":"ref3","first-page":"107","article-title":"Codes constructed on the base of <formula formulatype=\"inline\"><tex Notation=\"TeX\">$(L,g)$<\/tex><\/formula>-codes","volume":"8","author":"goppa","year":"1972","journal-title":"Probl Peredachi Inf"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054833"},{"key":"ref5","author":"grassl","year":"2007","journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes"},{"key":"ref8","author":"macwilliams","year":"1983","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055449"},{"key":"ref2","first-page":"41","article-title":"A rational representation of codes and <formula formulatype=\"inline\"><tex Notation=\"TeX\">$(L,g)$<\/tex> <\/formula>-codes","volume":"7","author":"goppa","year":"1971","journal-title":"Probl Peredachi Inf"},{"key":"ref1","first-page":"24","article-title":"A new class of linear correcting codes","volume":"6","author":"goppa","year":"1970","journal-title":"Probl Peredachi Inf"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6634534\/06574242.pdf?arnumber=6574242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:51Z","timestamp":1638218871000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6574242\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":8,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2276626","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}