{"id":"https://openalex.org/W2008359784","doi":"https://doi.org/10.1109/tcomm.2014.2378257","title":"On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memory","display_name":"On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memory","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2008359784","doi":"https://doi.org/10.1109/tcomm.2014.2378257","mag":"2008359784"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2014.2378257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2014.2378257","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","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/A5091630669","display_name":"Ghady Azar","orcid":null},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ghady Azar","raw_affiliation_strings":["Department of Mathematics and Statistics, Queen's University, Kingston, ON, Canada","Dept. of Math. & Stat., Queen's Univ., Kingston, ON, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Queen's University, Kingston, ON, Canada","institution_ids":["https://openalex.org/I204722609"]},{"raw_affiliation_string":"Dept. of Math. & Stat., Queen's Univ., Kingston, ON, Canada#TAB#","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065742137","display_name":"Fady Alajaji","orcid":"https://orcid.org/0000-0002-7980-724X"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Fady Alajaji","raw_affiliation_strings":["Department of Mathematics and Statistics, Queen's University, Kingston, ON, Canada","Dept. of Math. & Stat., Queen's Univ., Kingston, ON, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Queen's University, Kingston, ON, Canada","institution_ids":["https://openalex.org/I204722609"]},{"raw_affiliation_string":"Dept. of Math. & Stat., Queen's Univ., Kingston, ON, Canada#TAB#","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091630669"],"corresponding_institution_ids":["https://openalex.org/I204722609"],"apc_list":null,"apc_paid":null,"fwci":1.3792,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83105547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security 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.9993000030517578,"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.7597967386245728},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5784839987754822},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5577274560928345},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5173704028129578},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4917495548725128},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.47719821333885193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47335290908813477},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.4706130623817444},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.44566667079925537},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4169835150241852},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40153563022613525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33111000061035156},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.140379399061203},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13498082756996155}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7597967386245728},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5784839987754822},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5577274560928345},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5173704028129578},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4917495548725128},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.47719821333885193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47335290908813477},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.4706130623817444},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.44566667079925537},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4169835150241852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40153563022613525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33111000061035156},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.140379399061203},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13498082756996155}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2014.2378257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2014.2378257","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5199999809265137}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1524455811","https://openalex.org/W1549664537","https://openalex.org/W1597749830","https://openalex.org/W1968974808","https://openalex.org/W1989008275","https://openalex.org/W2005445905","https://openalex.org/W2031570691","https://openalex.org/W2040075573","https://openalex.org/W2053571792","https://openalex.org/W2088214533","https://openalex.org/W2108887739","https://openalex.org/W2111136916","https://openalex.org/W2118047086","https://openalex.org/W2119683335","https://openalex.org/W2122119900","https://openalex.org/W2142901448","https://openalex.org/W2143793950","https://openalex.org/W2147163807","https://openalex.org/W2154612888","https://openalex.org/W2158770864","https://openalex.org/W2171128557","https://openalex.org/W2184877031","https://openalex.org/W2187233361","https://openalex.org/W2256209916","https://openalex.org/W6631316655"],"related_works":["https://openalex.org/W2943247777","https://openalex.org/W2740543340","https://openalex.org/W2371167013","https://openalex.org/W1582340598","https://openalex.org/W1541021634","https://openalex.org/W2779867339","https://openalex.org/W2794545997","https://openalex.org/W2584980534","https://openalex.org/W2182731056","https://openalex.org/W66917582"],"abstract_inverted_index":{"We":[0,54,73],"study":[1],"the":[2,27,58,78,89,101],"optimal":[3],"maximum":[4],"likelihood":[5],"(ML)":[6],"block":[7],"decoding":[8,70],"of":[9,17,80,104],"general":[10],"binary":[11,18,45],"codes":[12,59,85],"sent":[13],"over":[14,88],"two":[15],"classes":[16],"additive":[19],"noise":[20],"channels":[21,49,61,90],"with":[22,51,108],"memory.":[23],"Specifically,":[24],"we":[25,95],"consider":[26],"infinite":[28],"and":[29,34,60,66,83,109],"finite":[30],"memory":[31],"Polya":[32],"contagion":[33],"queue-based":[35],"channel":[36],"models,":[37],"which":[38,64],"were":[39],"recently":[40],"shown":[41],"to":[42,100],"approximate":[43],"well":[44],"modulated":[46],"correlated":[47],"fading":[48],"used":[50,87],"hard-decision":[52],"demodulation.":[53],"establish":[55],"conditions":[56],"on":[57,77],"parameters":[62],"under":[63,91],"ML":[65,92],"minimum":[67],"Hamming":[68],"distance":[69],"are":[71],"equivalent.":[72],"also":[74],"present":[75],"results":[76,99],"optimality":[79],"classical":[81],"perfect":[82],"quasi-perfect":[84],"when":[86],"decoding.":[93],"Finally,":[94],"briefly":[96],"apply":[97],"these":[98],"dual":[102],"problem":[103],"syndrome":[105],"source":[106],"coding":[107],"without":[110],"side":[111],"information.":[112]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}