{"id":"https://openalex.org/W2143857243","doi":"https://doi.org/10.1109/tit.1969.1054380","title":"Complexity of decoders--I: Classes of decoding rules","display_name":"Complexity of decoders--I: Classes of decoding rules","publication_year":1969,"publication_date":"1969-11-01","ids":{"openalex":"https://openalex.org/W2143857243","doi":"https://doi.org/10.1109/tit.1969.1054380","mag":"2143857243"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1969.1054380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054380","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109804540","display_name":"John E. Savage","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Savage","raw_affiliation_strings":["Division of Engineering and the Center for Computer and Information Sciences, Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Division of Engineering and the Center for Computer and Information Sciences, Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109804540"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":4.5591,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.94858437,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"15","issue":"6","first_page":"689","last_page":"695"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8407905101776123},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6773205995559692},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.616638720035553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5305595397949219},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4865235686302185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4800916016101837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4622286260128021},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4564180374145508},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.45588549971580505},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4516526758670807},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.43171966075897217},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3996903598308563},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32838597893714905},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.26209378242492676},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.2565770745277405}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8407905101776123},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6773205995559692},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.616638720035553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5305595397949219},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4865235686302185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4800916016101837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4622286260128021},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4564180374145508},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.45588549971580505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4516526758670807},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.43171966075897217},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3996903598308563},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32838597893714905},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.26209378242492676},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.2565770745277405}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1969.1054380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054380","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1993944611","https://openalex.org/W2001873407","https://openalex.org/W2008825922","https://openalex.org/W2040323797","https://openalex.org/W2041404167","https://openalex.org/W2068422506","https://openalex.org/W2074905768","https://openalex.org/W2083774980","https://openalex.org/W2085118356","https://openalex.org/W2091915792","https://openalex.org/W2117476053","https://openalex.org/W2137264294","https://openalex.org/W2144253890","https://openalex.org/W2146969125","https://openalex.org/W2165731899","https://openalex.org/W2264297261","https://openalex.org/W2993383518","https://openalex.org/W3216147140","https://openalex.org/W4238661777","https://openalex.org/W6804434002"],"related_works":["https://openalex.org/W2028976748","https://openalex.org/W2085052822","https://openalex.org/W2118148379","https://openalex.org/W4210406383","https://openalex.org/W2160839632","https://openalex.org/W4303471944","https://openalex.org/W2744658369","https://openalex.org/W2110262961","https://openalex.org/W2976134719","https://openalex.org/W3010466778"],"abstract_inverted_index":{"Several":[0],"classes":[1,114],"of":[2,62,89,97,107,115],"decoding":[3,10,13,19,100],"rules":[4,20,30],"are":[5,31,51],"considered":[6],"here":[7],"including":[8],"block":[9,90],"rules,":[11,14],"tree":[12],"and":[15,17,36,46,65,68,74,109],"bounded-distance":[16],"minimum-distance":[18,73],"for":[21,77,111],"binary":[22,47],"parity-check":[23,78],"codes.":[24],"Under":[25],"the":[26,60,87,94,112],"assumption":[27],"that":[28,72],"these":[29],"implemented":[32],"with":[33,40,83],"combinational":[34],"circuits":[35],"sequential":[37],"machines":[38],"constructed":[39],"AND":[41],"gates,":[42,44],"OR":[43],"INVERTERS,":[45],"memory":[48,66],"cells,":[49,67],"bounds":[50],"derived":[52],"on":[53],"their":[54],"complexity.":[55],"Complexity":[56],"is":[57,70],"measured":[58],"by":[59],"number":[61],"logic":[63],"elements":[64],"it":[69],"shown":[71],"other":[75],"decoders":[76],"codes":[79],"can":[80],"be":[81],"realized":[82],"complexity":[84,110],"proportional":[85],"to":[86],"square":[88],"length,":[91],"although":[92],"at":[93],"possible":[95],"expense":[96],"a":[98],"large":[99],"time.":[101],"We":[102],"examine":[103],"tradeoffs":[104],"between":[105],"probability":[106],"error":[108],"several":[113],"rules.":[116]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}