{"id":"https://openalex.org/W2101337488","doi":"https://doi.org/10.1109/tit.1979.1056073","title":"Algebraic analog decoding of linear binary codes","display_name":"Algebraic analog decoding of linear binary codes","publication_year":1979,"publication_date":"1979-07-01","ids":{"openalex":"https://openalex.org/W2101337488","doi":"https://doi.org/10.1109/tit.1979.1056073","mag":"2101337488"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1979.1056073","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1979.1056073","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/A5112622518","display_name":"L. Rudolph","orcid":null},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Rudolph","raw_affiliation_strings":["School of Computer and Information Science, Syracuse University, Syracuse, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Information Science, Syracuse University, Syracuse, NY, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111947581","display_name":"C. Hartmann","orcid":"https://orcid.org/0009-0007-5067-589X"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Hartmann","raw_affiliation_strings":["School of Computer and Information Science, Syracuse University, Syracuse, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Information Science, Syracuse University, Syracuse, NY, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030370838","display_name":"Tai-Yang Hwang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tai-Yang Hwang","raw_affiliation_strings":["Ministry of Communications, Telecommunication Laboratories, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ministry of Communications, Telecommunication Laboratories, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108716690","display_name":"Nguyen Quang \u0110uc","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen Duc","raw_affiliation_strings":["TELECOM Australia, Clayton, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TELECOM Australia, Clayton, VIC, Australia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.6215,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.97749722,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"4","first_page":"430","last_page":"440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7431106567382812},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.6844817399978638},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.6327565312385559},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6132012605667114},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5486999154090881},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5307852029800415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4732162058353424},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.47094735503196716},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4581103026866913},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4535338878631592},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4532400965690613},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43459415435791016},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.41930216550827026},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4114688038825989},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3228284418582916},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.2990304231643677},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.24195101857185364},{"id":"https://openalex.org/keywords/white-noise","display_name":"White noise","score":0.19274523854255676},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12291181087493896}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7431106567382812},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.6844817399978638},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.6327565312385559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6132012605667114},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5486999154090881},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5307852029800415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4732162058353424},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.47094735503196716},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4581103026866913},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4535338878631592},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4532400965690613},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43459415435791016},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.41930216550827026},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4114688038825989},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3228284418582916},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.2990304231643677},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.24195101857185364},{"id":"https://openalex.org/C112633086","wikidata":"https://www.wikidata.org/wiki/Q381287","display_name":"White noise","level":2,"score":0.19274523854255676},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12291181087493896},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1979.1056073","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1979.1056073","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":[{"score":0.800000011920929,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1531447875","https://openalex.org/W1563399474","https://openalex.org/W2039686225","https://openalex.org/W2115198523","https://openalex.org/W2143081194","https://openalex.org/W2797936250","https://openalex.org/W4245256025","https://openalex.org/W4300353561"],"related_works":["https://openalex.org/W1995527419","https://openalex.org/W1599365967","https://openalex.org/W4205451769","https://openalex.org/W4244153028","https://openalex.org/W2521769401","https://openalex.org/W2952102465","https://openalex.org/W2141877208","https://openalex.org/W2226710168","https://openalex.org/W2169426742","https://openalex.org/W4298835066"],"abstract_inverted_index":{"Bit-by-bit":[0],"soft-decision":[1],"decoding":[2,71],"of":[3,45,66],"binary":[4],"cyclic":[5],"codes":[6,86],"is":[7,37,52,73],"considered.":[8],"A":[9],"significant":[10],"reduction":[11],"in":[12],"decoder":[13,23],"complexity":[14],"can":[15],"be":[16],"achieved":[17],"by":[18],"requiring":[19],"only":[20],"that":[21],"the":[22,41,46,56,67,81,88],"correct":[24],"all":[25],"analog":[26,70],"error":[27],"patterns":[28],"which":[29],"fall":[30],"within":[31],"a":[32,49],"Euclidean":[33,43],"sphere":[34],"whose":[35],"radius":[36],"equal":[38],"to":[39],"half":[40],"minimum":[42],"distance":[44],"code.":[47],"Such":[48],"\"maximum-radius\"":[50],"scheme":[51,72],"asymptotically":[53],"optimum":[54],"for":[55,80],"additive":[57],"white":[58],"Gaussian":[59],"noise":[60],"(AWGN)":[61],"channel.":[62,90],"An":[63],"iterative":[64],"extension":[65],"basic":[68],"algebraic":[69],"discussed,":[74],"and":[75,84],"performance":[76],"curves":[77],"are":[78],"given":[79],"(17,9),":[82],"(21,11),":[83],"(73,45)":[85],"on":[87],"AWGN":[89]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}