{"id":"https://openalex.org/W1993498123","doi":"https://doi.org/10.1109/isit.2005.1523320","title":"A tree search method for iterative decoding of underdetermined multiuser systems","display_name":"A tree search method for iterative decoding of underdetermined multiuser systems","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1993498123","doi":"https://doi.org/10.1109/isit.2005.1523320","mag":"1993498123"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523320","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523320","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-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/A5002165692","display_name":"Adriel Kind","orcid":"https://orcid.org/0000-0001-6359-0210"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A.P. Kind","raw_affiliation_strings":["Agere Systems Australia"],"affiliations":[{"raw_affiliation_string":"Agere Systems Australia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072485708","display_name":"Alex Grant","orcid":"https://orcid.org/0000-0002-5345-7771"},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A. Grant","raw_affiliation_strings":["Institute for Telecommunications Research, University of South Australia, Australia"],"affiliations":[{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia, Australia","institution_ids":["https://openalex.org/I170239107"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002165692"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3628,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64264032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"189","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":1.0,"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/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/T10575","display_name":"Wireless Communication Networks Research","score":0.9995999932289124,"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/underdetermined-system","display_name":"Underdetermined system","score":0.87919682264328},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6870366334915161},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6737063527107239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5474258065223694},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5207619667053223},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5201540589332581},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5122780203819275},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46586111187934875},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.42264264822006226},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40036648511886597},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.322073757648468},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2723546028137207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2551785111427307}],"concepts":[{"id":"https://openalex.org/C179690561","wikidata":"https://www.wikidata.org/wiki/Q4316110","display_name":"Underdetermined system","level":2,"score":0.87919682264328},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6870366334915161},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6737063527107239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5474258065223694},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5207619667053223},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5201540589332581},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5122780203819275},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46586111187934875},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.42264264822006226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40036648511886597},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.322073757648468},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2723546028137207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2551785111427307},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2005.1523320","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523320","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.8975","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.8975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0501081v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.3385","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.3385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itr.unisa.edu.au/~steven/turbo/ISIT05a.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W44524813","https://openalex.org/W1540275787","https://openalex.org/W1598650046","https://openalex.org/W1934949969","https://openalex.org/W2088185204","https://openalex.org/W2102099405","https://openalex.org/W2103402707","https://openalex.org/W2106594619","https://openalex.org/W2108593406","https://openalex.org/W2108656301","https://openalex.org/W2112772743","https://openalex.org/W2112976436","https://openalex.org/W2120757244","https://openalex.org/W2121606987","https://openalex.org/W2126304631","https://openalex.org/W2127786992","https://openalex.org/W2129881681","https://openalex.org/W2132636621","https://openalex.org/W2134019436","https://openalex.org/W2136979582","https://openalex.org/W2155638995","https://openalex.org/W2159059820","https://openalex.org/W2162855518","https://openalex.org/W2164324555","https://openalex.org/W2167406563","https://openalex.org/W2169258510","https://openalex.org/W2171470636","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3128587426","https://openalex.org/W2951435047","https://openalex.org/W2227684440","https://openalex.org/W2739550867","https://openalex.org/W1993498123","https://openalex.org/W2156833871","https://openalex.org/W2359807192","https://openalex.org/W2174962524","https://openalex.org/W2083751087","https://openalex.org/W2157743338"],"abstract_inverted_index":{"Application":[0],"of":[1,12,18,45,56,70,96,101,121],"the":[2,24,42,66,88,102,131],"turbo":[3],"principle":[4],"to":[5,84,87,108,125],"multiuser":[6],"decoding":[7],"results":[8],"in":[9,65],"an":[10],"exchange":[11],"probability":[13,39],"distributions":[14],"between":[15],"two":[16],"sets":[17],"constraints.":[19],"Firstly,":[20],"constraints":[21,30,46],"imposed":[22,31],"by":[23,32,91],"multiple-access":[25],"channel,":[26],"and":[27],"secondly,":[28],"individual":[29],"each":[33],"users'":[34],"error":[35],"control":[36],"code.":[37],"A-posteriori":[38],"computation":[40],"for":[41,50],"first":[43],"set":[44],"is":[47,72,83],"prohibitively":[48],"complex":[49],"all":[51],"but":[52],"a":[53,94,116],"small":[54],"number":[55],"users.":[57],"Several":[58],"lower":[59],"complexity":[60],"approaches":[61],"have":[62],"been":[63],"proposed":[64],"literature.":[67],"One":[68],"class":[69],"methods":[71,105,124,138],"based":[73,134],"on":[74],"linear":[75],"filtering":[76],"(e.g.":[77],"LMMSE).":[78],"A":[79],"more":[80],"recent":[81],"approach":[82],"compute":[85],"approximations":[86],"posterior":[89],"probabilities":[90],"marginalising":[92],"over":[93],"subset":[95],"sequences":[97],"(list":[98],"detection).":[99],"Most":[100],"list":[103],"detection":[104],"are":[106],"restricted":[107],"non-singular":[109],"systems.":[110,127],"In":[111],"this":[112],"paper,":[113],"we":[114],"introduce":[115],"transformation":[117],"that":[118,130],"permits":[119],"application":[120],"standard":[122],"tree-search":[123,133],"underdetermined":[126],"We":[128],"find":[129],"resulting":[132],"receiver":[135],"outperforms":[136],"existing":[137]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}