{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:36Z","timestamp":1767339456209},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0166-218x(91)90107-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"43-60","source":"Crossref","is-referenced-by-count":8,"title":["New approaches to reduced-complexity decoding"],"prefix":"10.1016","volume":"33","author":[{"given":"John T.","family":"Coffey","sequence":"first","affiliation":[]},{"given":"Rodney M.","family":"Goodman","sequence":"additional","affiliation":[]},{"given":"Patrick G.","family":"Farrell","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90107-8_bib1","first-page":"5","article-title":"Problems of complexity in the theory of correcting codes","volume":"13","author":"Bassalygo","year":"1977","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0166-218X(91)90107-8_bib2","first-page":"42","article-title":"Decoding with multipliers","volume":"42","author":"Baumert","year":"1976"},{"key":"10.1016\/0166-218X(91)90107-8_bib3","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TIT.1986.1057170","article-title":"Capability of error-trapping technique in decoding cyclic codes","volume":"32","author":"Benyamin-Seeyar","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib4","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/PROC.1980.11696","article-title":"The technology of error-correcting codes","volume":"68","author":"Berlekamp","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/0166-218X(91)90107-8_bib5","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","article-title":"On the inherent intractability of certain coding problems","volume":"24","author":"Berlekamp","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib6","first-page":"50","article-title":"Lower asymptotic bound on the number of linear code words in a sphere of given radius in Fnq","volume":"23","author":"Blinovskii","year":"1987","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0166-218X(91)90107-8_bib7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TIT.1981.1056392","article-title":"(n,k,t)-covering systems and error-trapping decoding","volume":"27","author":"Chan","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib8","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1109\/TIT.1972.1054746","article-title":"A class of algorithms for decoding block codes with channel measurement information","volume":"18","author":"Chase","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib9","series-title":"Error-Correcting Coding for Digital Communications","author":"Clark","year":"1981"},{"key":"10.1016\/0166-218X(91)90107-8_bib10","series-title":"Ph.D. Dissertation","article-title":"On complexity and efficiency in encoding and decoding error-correcting codes","author":"Coffey","year":"1989"},{"key":"10.1016\/0166-218X(91)90107-8_bib11","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1109\/18.57202","article-title":"The complexity of information set decoding","volume":"36","author":"Coffey","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib12","first-page":"102","article-title":"An algorithm for the correction of independent errors by cyclic codes","volume":"3","author":"Dmitriev","year":"1967","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0166-218X(91)90107-8_bib13","first-page":"3","article-title":"Complexity of decoding for linear codes","volume":"19","author":"Evseev","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0166-218X(91)90107-8_bib14","article-title":"Minimum weight decoding for cyclic codes","author":"Farrell","year":"1986","journal-title":"Proceedings IMA Conference on Cryptography and Coding"},{"key":"10.1016\/0166-218X(91)90107-8_bib15","article-title":"Division algorithms for hard and soft decision decoders","author":"Farrell","year":"1987","journal-title":"Proceedings International Conference on Digital Signal Processing"},{"key":"10.1016\/0166-218X(91)90107-8_bib16","series-title":"Ph.D. Dissertation","article-title":"Coding for a discrete information source with a distortion measure","author":"Goblick","year":"1962"},{"key":"10.1016\/0166-218X(91)90107-8_bib17","first-page":"365","article-title":"Microprocessor-controlled permutation decoding of error-correcting codes","volume":"41","author":"Goodman","year":"1978","journal-title":"Proceedings IERE Conference on Microprocessors in Automation and Communications"},{"key":"10.1016\/0166-218X(91)90107-8_bib18","article-title":"An improvement of the zero-neighbors minimum distance decoding algorithm: the zero-guard algorithm","author":"Hartmann","year":"1988","journal-title":"1988 IEEE International Symposium on Information Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib19","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TIT.1979.1056120","article-title":"Decoding linear block codes for minimizing word error rate","volume":"25","author":"Hwang","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib20","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/TIT.1964.1053649","article-title":"A decoding procedure for multiple-error-correcting cyclic codes","volume":"10","author":"Kasami","year":"1964","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib21","first-page":"35","article-title":"On some properties of random group codes of great length","volume":"1","author":"Koshelev","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0166-218X(91)90107-8_bib22","first-page":"413","article-title":"The correcting capacities of linear codes","volume":"14","author":"Kozlov","year":"1969","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/0166-218X(91)90107-8_bib23","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/TIT.1985.1057038","article-title":"A new approach to the general minimum distance decoding problem\u2014the zero neighbors algorithm","volume":"31","author":"Levitin","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib24","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1002\/j.1538-7305.1964.tb04075.x","article-title":"Permutation decoding of systematic codes","volume":"43","author":"MacWilliams","year":"1964","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0166-218X(91)90107-8_bib25","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0166-218X(91)90107-8_bib26","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0019-9958(79)90686-7","article-title":"On vote-taking and complete decoding of certain error-correcting codes","volume":"43","author":"Mandelbaum","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(91)90107-8_bib27","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0019-9958(80)90526-4","article-title":"On complete decoding of linear error-correcting codes","volume":"47","author":"Mandelbaum","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(91)90107-8_bib28","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"42","author":"McEliece","year":"1978"},{"key":"10.1016\/0166-218X(91)90107-8_bib29","article-title":"A general minimum distance decoding procedure for binary linear block codes","author":"Montgomery","year":"1986","journal-title":"Proceedings IEEE International Symposium on Information Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib30","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/TIT.1967.1054053","article-title":"Limit distribution of the minimum distance of random linear codes","volume":"13","author":"Pierce","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib31","doi-asserted-by":"crossref","first-page":"S5","DOI":"10.1109\/TIT.1962.1057777","article-title":"The use of information sets in decoding cyclic codes","volume":"8","author":"Prange","year":"1962","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib32","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TIT.1972.1054812","article-title":"Permutation decoding of certain triple-error-correcting binary codes","volume":"18","author":"Shiva","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib33","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TIT.1984.1056915","article-title":"An error-trapping decoder for nonbinary cyclic codes","volume":"30","author":"Wei","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90107-8_bib34","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TIT.1978.1055821","article-title":"Efficient maximum likelihood of linear block using a trellis","volume":"24","author":"Wolf","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91901078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91901078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:21:38Z","timestamp":1555136498000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X91901078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0166218X91901078"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90107-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}