{"id":"https://openalex.org/W2129040146","doi":"https://doi.org/10.1109/tit.1983.1056667","title":"Upper bounds on|C_2|for a uniquely decodable code pair(C_1, C_2)for a two-access binary adder channel","display_name":"Upper bounds on|C_2|for a uniquely decodable code pair(C_1, C_2)for a two-access binary adder channel","publication_year":1983,"publication_date":"1983-05-01","ids":{"openalex":"https://openalex.org/W2129040146","doi":"https://doi.org/10.1109/tit.1983.1056667","mag":"2129040146"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056667","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/4e064ea8-f53d-47aa-b999-33eed0d671fb","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039310780","display_name":"H. van Tilborg","orcid":null},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"H. van Tilborg","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhovan University of Technology, Eindhoven, Netherlands","Discrete Mathematics"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhovan University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Discrete Mathematics","institution_ids":["https://openalex.org/I2799411422"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039310780"],"corresponding_institution_ids":["https://openalex.org/I2799411422","https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":2.3256,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.90554058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"29","issue":"3","first_page":"386","last_page":"389"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9959999918937683,"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.994700014591217,"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/code","display_name":"Code (set theory)","score":0.6598271727561951},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4915095269680023},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43960121273994446},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4034034311771393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3855610489845276},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3446905016899109},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3192150592803955},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14079764485359192}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6598271727561951},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4915095269680023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43960121273994446},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4034034311771393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3855610489845276},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3446905016899109},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3192150592803955},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14079764485359192},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.1983.1056667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056667","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"},{"id":"pmh:oai:pure.tue.nl:openaire/4e064ea8-f53d-47aa-b999-33eed0d671fb","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/4e064ea8-f53d-47aa-b999-33eed0d671fb","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tilborg, van, H C A 1983, 'Upper bounds on |C2| for a uniquely decodable code pair (C1,C2) for a two-access binary adder channel', IEEE Transactions on Information Theory, vol. 29, no. 3, pp. 386-389. https://doi.org/10.1109/TIT.1983.1056667","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/4e064ea8-f53d-47aa-b999-33eed0d671fb","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/4e064ea8-f53d-47aa-b999-33eed0d671fb","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 29(3), 386 - 389. Institute of Electrical and Electronics Engineers","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/4e064ea8-f53d-47aa-b999-33eed0d671fb","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/4e064ea8-f53d-47aa-b999-33eed0d671fb","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tilborg, van, H C A 1983, 'Upper bounds on |C2| for a uniquely decodable code pair (C1,C2) for a two-access binary adder channel', IEEE Transactions on Information Theory, vol. 29, no. 3, pp. 386-389. https://doi.org/10.1109/TIT.1983.1056667","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1577322816","https://openalex.org/W1592482298","https://openalex.org/W1606480398","https://openalex.org/W2083570022","https://openalex.org/W2094760650","https://openalex.org/W2121546896","https://openalex.org/W2137384791","https://openalex.org/W2151985534","https://openalex.org/W2160841597","https://openalex.org/W3173652044","https://openalex.org/W6635532581"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W2572370460"],"abstract_inverted_index":{"An":[0],"algebraic":[1],"and":[2],"a":[3,26,36],"combinatorial":[4],"upper":[5],"bound":[6],"are":[7],"derived":[8],"on":[9],"<tex":[10,16,21,31,48],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[11,17,22,32,49],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">|C_{2}|</tex>":[12],"given":[13],"the":[14],"code":[15,29,44],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">C_{1}</tex>":[18],",":[19],"where":[20],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(C_{l},":[23],"C_{2})</tex>":[24,34],"is":[25,52],"uniquely":[27,42],"decodable":[28,43],"pair":[30,47],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(C_{1},":[33],"for":[35],"two-access":[37],"binary":[38],"adder":[39],"channel.":[40],"A":[41],"with":[45],"rate":[46],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(0.5170,":[50],"0.7814)</tex>":[51],"also":[53],"described.":[54]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-02-25T23:00:34.991745","created_date":"2016-06-24T00:00:00"}