{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:44:54Z","timestamp":1648917894006},"reference-count":7,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0140-3664(98)00149-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:03:07Z","timestamp":1027609387000},"page":"736-740","source":"Crossref","is-referenced-by-count":4,"title":["Proposal of sub-optimum decoding algorithm with a bound of Voronoi region V(C0)"],"prefix":"10.1016","volume":"21","author":[{"suffix":"Jr","given":"Walter","family":"Godoy","sequence":"first","affiliation":[]},{"given":"Em\u0131\u0301lio C.G.","family":"Wille","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0140-3664(98)00149-2_BIB1","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0140-3664(97)00018-2","article-title":"A new approach to the information set decoding algorithm","volume":"20","author":"Barros","year":"1997","journal-title":"Computer Communication"},{"key":"10.1016\/S0140-3664(98)00149-2_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1966.1053873","article-title":"Generalized minimum distance decoding","volume":"12","author":"Forney","year":"1966","journal-title":"IEEE Trans. On Inf. Theory IT"},{"key":"10.1016\/S0140-3664(98)00149-2_BIB3","unstructured":"W. Godoy, Doctor Tesis, UNICAMP, Campinas, SP, Brazil, 1990."},{"issue":"3","key":"10.1016\/S0140-3664(98)00149-2_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1985.1057038","article-title":"A new approach to the general minimum distance decoding problem: the zero neighbors algorithm","volume":"31","author":"Levitin","year":"1985","journal-title":"IEEE Trans. On Inf. Theory IT"},{"key":"10.1016\/S0140-3664(98)00149-2_BIB5","unstructured":"W. Godoy Jr and E.C.G. Wille, Proposta de um Algoritmo Sub-\u00f3timo com um limiar da Regi\u00e3o de Voronoi V(C0), XV Simp\u00f3sio Brasileiro de Telecomunica\u00e7\u00f5es. 8\u201311 Sept., Recife, PE, Brazil, 1997."},{"key":"10.1016\/S0140-3664(98)00149-2_BIB6","unstructured":"R.F. Baldini, C\u00f3digos Pseudo C\u0131\u0301clicos Multin\u0131\u0301veis. VII Simp\u00f3sio Brasileiro de Telecomunica\u00e7\u00f5es. Florian\u00f3polis, SC, Set. Brazil, 1989."},{"key":"10.1016\/S0140-3664(98)00149-2_BIB7","unstructured":"W. Godoy Jr, Esquemas de Modula\u00e7\u00e3o Codificada com C\u00f3digos de Bloco BCM. Curitiba. Editora CEFET-PR, 1991."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498001492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498001492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T23:20:33Z","timestamp":1555975233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366498001492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":7,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0140366498001492"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(98)00149-2","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}