{"id":"https://openalex.org/W2105081412","doi":"https://doi.org/10.1109/18.485711","title":"Nearly optimal multiuser codes for the binary adder channel","display_name":"Nearly optimal multiuser codes for the binary adder channel","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W2105081412","doi":"https://doi.org/10.1109/18.485711","mag":"2105081412"},"language":"en","primary_location":{"id":"doi:10.1109/18.485711","is_oa":false,"landing_page_url":"https://doi.org/10.1109/18.485711","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/A5111162654","display_name":"B.L. Hughes","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B.L. Hughes","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066462638","display_name":"A.B. Cooper","orcid":null},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.B. Cooper","raw_affiliation_strings":["Information Science and Technology Directorate, U.S. Army Research Laboratory, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Science and Technology Directorate, U.S. Army Research Laboratory, MD, USA","institution_ids":["https://openalex.org/I166416128"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1393,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.84306692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"42","issue":"2","first_page":"387","last_page":"398"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/adder","display_name":"Adder","score":0.7235012054443359},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6016923189163208},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.584592878818512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5148683786392212},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5118345618247986},{"id":"https://openalex.org/keywords/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.5037533640861511},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.5022487640380859},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4788498878479004},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.45431801676750183},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4495280981063843},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.43658286333084106},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4286152124404907},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.41425469517707825},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.4101193845272064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3958038091659546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.373546838760376},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36766886711120605},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3663991093635559},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3511102795600891},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.28296104073524475},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11735838651657104}],"concepts":[{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.7235012054443359},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6016923189163208},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.584592878818512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5148683786392212},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5118345618247986},{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.5037533640861511},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.5022487640380859},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4788498878479004},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.45431801676750183},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4495280981063843},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.43658286333084106},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4286152124404907},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.41425469517707825},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.4101193845272064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3958038091659546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.373546838760376},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36766886711120605},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3663991093635559},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3511102795600891},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.28296104073524475},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11735838651657104},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"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":1,"locations":[{"id":"doi:10.1109/18.485711","is_oa":false,"landing_page_url":"https://doi.org/10.1109/18.485711","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":25,"referenced_works":["https://openalex.org/W1981659698","https://openalex.org/W2003564337","https://openalex.org/W2006309149","https://openalex.org/W2014996477","https://openalex.org/W2052482591","https://openalex.org/W2058703837","https://openalex.org/W2065338886","https://openalex.org/W2065348575","https://openalex.org/W2094760650","https://openalex.org/W2099111195","https://openalex.org/W2099505289","https://openalex.org/W2106936717","https://openalex.org/W2120058847","https://openalex.org/W2123494558","https://openalex.org/W2123704833","https://openalex.org/W2124488997","https://openalex.org/W2129040146","https://openalex.org/W2138738436","https://openalex.org/W2150272963","https://openalex.org/W2155110206","https://openalex.org/W2162011945","https://openalex.org/W2164146149","https://openalex.org/W2475691105","https://openalex.org/W3173652044","https://openalex.org/W4300694379"],"related_works":["https://openalex.org/W2085903266","https://openalex.org/W1583152740","https://openalex.org/W2034718882","https://openalex.org/W2083839461","https://openalex.org/W1825018585","https://openalex.org/W2987657883","https://openalex.org/W1995419504","https://openalex.org/W1794323723","https://openalex.org/W2141977859","https://openalex.org/W2071990171"],"abstract_inverted_index":{"Coding":[0],"schemes":[1],"for":[2,14,65],"the":[3,40,46,75],"T-user":[4,41],"binary":[5],"adder":[6,83],"channel":[7,84],"are":[8,12,85],"investigated.":[9],"Recursive":[10],"constructions":[11],"given":[13],"two":[15],"families":[16],"of":[17,74],"mixed-rate,":[18],"multiuser":[19],"codes.":[20],"It":[21],"is":[22,58,70],"shown":[23],"that":[24],"these":[25],"basic":[26],"codes":[27,35,48,64],"can":[28],"be":[29],"combined":[30],"by":[31],"time-sharing":[32],"to":[33,79],"yield":[34],"approaching":[36],"most":[37],"rates":[38],"in":[39],"capacity":[42],"region.":[43],"In":[44],"particular,":[45],"best":[47],"constructed":[49],"herein":[50],"achieve":[51],"a":[52,80],"sum-rate,":[53],"R/sub":[54],"1/+...+R/sub":[55],"T/,":[56],"which":[57],"higher":[59],"than":[60],"all":[61],"previously":[62],"reported":[63],"almost":[66],"every":[67],"T":[68],"and":[69],"within":[71],"0.547-bit-per-channel":[72],"use":[73],"information-theoretic":[76],"limit.":[77],"Extensions":[78],"T-user,":[81],"Q-frequency":[82],"also":[86],"discussed.":[87]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}