{"id":"https://openalex.org/W1987775521","doi":"https://doi.org/10.1109/tit.1980.1056274","title":"Error probability and free distance bounds for two-user tree codes on multiple-access channels","display_name":"Error probability and free distance bounds for two-user tree codes on multiple-access channels","publication_year":1980,"publication_date":"1980-11-01","ids":{"openalex":"https://openalex.org/W1987775521","doi":"https://doi.org/10.1109/tit.1980.1056274","mag":"1987775521"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1980.1056274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1980.1056274","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/A5103062028","display_name":"Roger Tory Peterson","orcid":"https://orcid.org/0000-0003-3245-910X"},"institutions":[{"id":"https://openalex.org/I1333370159","display_name":"Motorola (United States)","ror":"https://ror.org/01hafxd32","country_code":"US","type":"company","lineage":["https://openalex.org/I1333370159"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Peterson","raw_affiliation_strings":["Bell Laboratories, Inc., Holmdel, NJ, USA","Government Electronics Division, Communications Research Facility, Motorola, Inc., Gilbert, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Inc., Holmdel, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Government Electronics Division, Communications Research Facility, Motorola, Inc., Gilbert, AZ, USA","institution_ids":["https://openalex.org/I1333370159"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Costello","raw_affiliation_strings":["Department of Electrical Engineering, Illinois Institute of Technology, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Illinois Institute of Technology, Chicago, IL, USA","institution_ids":["https://openalex.org/I180949307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103062028"],"corresponding_institution_ids":["https://openalex.org/I1333370159"],"apc_list":null,"apc_paid":null,"fwci":1.3247,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.82050645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"6","first_page":"658","last_page":"670"},"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.9994000196456909,"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.9994000196456909,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9991999864578247,"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.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.795301079750061},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5766844749450684},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5743453502655029},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5498905777931213},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5329113006591797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4975636303424835},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4686383903026581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46261054277420044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42729824781417847},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.42111003398895264},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3967251181602478},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38100725412368774},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.360590398311615},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.23051929473876953},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22157973051071167}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.795301079750061},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5766844749450684},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5743453502655029},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5498905777931213},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5329113006591797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4975636303424835},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4686383903026581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46261054277420044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42729824781417847},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.42111003398895264},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3967251181602478},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38100725412368774},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.360590398311615},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.23051929473876953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22157973051071167},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1980.1056274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1980.1056274","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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1972484560","https://openalex.org/W1978382377","https://openalex.org/W1986083823","https://openalex.org/W1989008275","https://openalex.org/W1991133427","https://openalex.org/W1993730784","https://openalex.org/W1995875735","https://openalex.org/W2011002664","https://openalex.org/W2020992040","https://openalex.org/W2083570022","https://openalex.org/W2121546896","https://openalex.org/W2160841597","https://openalex.org/W2164864022","https://openalex.org/W3025125170","https://openalex.org/W3173652044","https://openalex.org/W6777527443"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W3083229674","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W3096151594","https://openalex.org/W2964031101","https://openalex.org/W4200209838","https://openalex.org/W2798867000","https://openalex.org/W4299726024"],"abstract_inverted_index":{"Two-user":[0],"tree":[1,18,30,143,166],"codes":[2,31,197],"are":[3,74,83],"considered":[4],"for":[5,56,61,67,99,105,157,195],"use":[6],"on":[7,32,91,192],"an":[8],"arbitrary":[9],"two-user":[10,17,29,100,142,184,196],"discrete":[11],"memoryless":[12],"multiple-access":[13],"channel":[14],"(MAC).":[15],"A":[16,141],"Is":[19],"employed":[20],"to":[21,96,206],"achieve":[22],"true":[23],"maximum":[24],"likelihood":[25],"(ML)":[26],"decoding":[27,35,52,92,117],"of":[28,107,130],"MAC's.":[33],"Each":[34],"error":[36,53,93,108,118,145,168,176,209],"event":[37],"has":[38,54],"associated":[39],"with":[40,151],"it":[41,78],"a":[42,51,111,123,131,158,188],"configuration":[43,86,139],"indicating":[44],"the":[45,57,62,137,152,165,173,183,201,208],"specific":[46,159],"time":[47],"slots":[48],"in":[49],"which":[50],"occurred":[55],"first":[58,126],"user":[59,64],"alone,":[60,65],"second":[63],"or":[66],"both":[68],"users":[69],"simultaneously.":[70],"Even":[71],"though":[72],"there":[73,82],"many":[75],"possible":[76],"configurations,":[77],"is":[79,103,120,147,162,170,198],"shown":[80],"that":[81,164],"five":[84,138],"fundamental":[85],"types.":[87,140],"An":[88],"upper":[89],"bound":[90,125,191,207],"probability,":[94],"similar":[95],"Liao's":[97],"result":[98,156],"block":[101,154,174],"codes,":[102],"derived":[104,199],"sets":[106],"events":[109],"having":[110],"particular":[112],"configuration.":[113],"The":[114],"total":[115],"ML":[116],"probability":[119],"bounded":[121],"using":[122,200],"union":[124],"over":[127,136],"all":[128,179],"configurations":[129],"given":[132],"type":[133],"and":[134,149],"then":[135],"coding":[144,155,167,175],"exponent":[146,169,177],"defined":[148],"compared":[150],"corresponding":[153],"MAC.":[160],"It":[161],"seen":[163],"larger":[171],"than":[172],"at":[178],"rate":[180],"pairs":[181],"within":[182],"capacity":[185],"region.":[186],"Finally,":[187],"new":[189],"lower":[190],"free":[193],"distance":[194],"same":[202],"general":[203],"technique":[204],"used":[205],"probability.":[210]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}