{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:50:55Z","timestamp":1775757055906,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"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":[[2008,12]]},"DOI":"10.1109\/tit.2008.2006442","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T16:30:00Z","timestamp":1228149000000},"page":"5773-5778","source":"Crossref","is-referenced-by-count":10,"title":["Chain of Separable Binary Goppa Codes and Their Minimal Distance"],"prefix":"10.1109","volume":"54","author":[{"given":"Sergey","family":"Bezzateev","sequence":"first","affiliation":[]},{"given":"Natalia","family":"Shekhunova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"98","article-title":"a subclass of binary goppa codes","volume":"25","author":"shekhunova","year":"1989","journal-title":"Probl Inf Transm"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1995.550486"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008327723647"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.651048"},{"key":"ref14","article-title":"good ensembles of goppa codes","author":"maatouk","year":"2007","journal-title":"Ecole Polytechnique Federale De Lausanne ALGO Lab"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008252303768"},{"key":"ref4","first-page":"352","article-title":"on the designed distance of the best known (55,16,19) goppa code","volume":"23","author":"bezzateev","year":"1987","journal-title":"Probl Inf Transm"},{"key":"ref3","first-page":"140","article-title":"one subclass of binary goppa codes","author":"bezzateev","year":"1986","journal-title":"Proc XI Simp Po Probl Izbit v Inf Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.135654"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057276"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011281431366"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.370170"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056946"},{"key":"ref1","first-page":"24","article-title":"a new class of linear error correcting codes.","volume":"6","author":"goppa","year":"1970","journal-title":"Probl Inf Transm"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-004-1722-4"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4675712\/04675743.pdf?arnumber=4675743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:47:24Z","timestamp":1638200844000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4675743\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":15,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2006442","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}