{"id":"https://openalex.org/W2065338886","doi":"https://doi.org/10.1109/tit.1985.1057004","title":"A family of good uniquely decodable code pairs for the two-access binary adder channel","display_name":"A family of good uniquely decodable code pairs for the two-access binary adder channel","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2065338886","doi":"https://doi.org/10.1109/tit.1985.1057004","mag":"2065338886"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1985.1057004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1985.1057004","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/A5075537326","display_name":"P.C. van den Braak","orcid":null},"institutions":[{"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"],"is_corresponding":true,"raw_author_name":"P.C. van den Braak","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhovan University of Technology, Eindhoven, Netherlands","[Department of Mathematics and Computing Science, Eindhovan University of Technology, Eindhoven, Netherlands]"],"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":"[Department of Mathematics and Computing Science, Eindhovan University of Technology, Eindhoven, Netherlands]","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039310780","display_name":"H. van Tilborg","orcid":null},"institutions":[{"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"],"is_corresponding":false,"raw_author_name":"H. van Tilborg","raw_affiliation_strings":["Department of Mathematics, Science, Eindhovan University of Technology, Eindhoven, Netherlands","[Department of Mathematics, Science, Eindhovan University of Technology, Eindhoven, Netherlands]"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Science, Eindhovan University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"[Department of Mathematics, Science, Eindhovan University of Technology, Eindhoven, Netherlands]","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075537326"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":2.0999,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.89700834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"1","first_page":"3","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9988999962806702,"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/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6518296599388123},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6306325197219849},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6246325969696045},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5939998626708984},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5930625200271606},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.5556398630142212},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5436061024665833},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5316802859306335},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5082802176475525},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4979884624481201},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.49277785420417786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4927544891834259},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.489241361618042},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4826846122741699},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.47209256887435913},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44568926095962524},{"id":"https://openalex.org/keywords/adder","display_name":"Adder","score":0.43360060453414917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39162200689315796},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.38700324296951294},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3752773106098175},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.33264249563217163},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3292285203933716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.312812864780426},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.29257360100746155},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.15835270285606384},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05931597948074341}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6518296599388123},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6306325197219849},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6246325969696045},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5939998626708984},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5930625200271606},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.5556398630142212},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5436061024665833},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5316802859306335},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5082802176475525},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4979884624481201},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.49277785420417786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4927544891834259},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.489241361618042},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4826846122741699},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.47209256887435913},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44568926095962524},{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.43360060453414917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39162200689315796},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.38700324296951294},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3752773106098175},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.33264249563217163},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3292285203933716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.312812864780426},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29257360100746155},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.15835270285606384},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05931597948074341},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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.1985.1057004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1985.1057004","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_cris_publications/f8dfe64a-0e8f-4bea-baf2-1da2dfb3c07d","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/f8dfe64a-0e8f-4bea-baf2-1da2dfb3c07d","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Coebergh van den Braak, P A B M & Tilborg, van, H C A 1985, 'A family of good uniquely decodable code pairs for the two-access binary adder channel', IEEE Transactions on Information Theory, vol. 31, no. 1, pp. 3-9. https://doi.org/10.1109/TIT.1985.1057004","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/f8dfe64a-0e8f-4bea-baf2-1da2dfb3c07d","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/f8dfe64a-0e8f-4bea-baf2-1da2dfb3c07d","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 31(1), 3 - 9. Institute of Electrical and Electronics Engineers","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1592482298","https://openalex.org/W2083570022","https://openalex.org/W2094760650","https://openalex.org/W2121546896","https://openalex.org/W2129040146","https://openalex.org/W2137384791","https://openalex.org/W2160841597","https://openalex.org/W2171200795","https://openalex.org/W3173652044","https://openalex.org/W6635532581"],"related_works":["https://openalex.org/W2497702133","https://openalex.org/W1631960500","https://openalex.org/W2975172758","https://openalex.org/W2082705204","https://openalex.org/W3019935802","https://openalex.org/W4250402636","https://openalex.org/W2025383691","https://openalex.org/W2068074382","https://openalex.org/W2161801578","https://openalex.org/W2369287763"],"abstract_inverted_index":{"An":[0],"explicit":[1],"construction":[2,28],"is":[3,44],"presented":[4,43],"of":[5],"uniquely":[6,47],"decodable":[7,48],"code":[8,23,49],"pairs":[9,24],"for":[10],"the":[11,34,40],"two-access":[12],"binary":[13],"erasure":[14],"channel.":[15],"Through":[16],"a":[17,30,45,52,58],"computer":[18],"search":[19],"we":[20],"found":[21,56],"many":[22],"coming":[25],"from":[26],"this":[27],"with":[29,51],"rate":[31,54],"pair":[32],"above":[33],"nonconstructive":[35],"lower":[36],"bound":[37],"known":[38],"in":[39],"literature.":[41],"Also":[42],"simple":[46],"pair,":[50,55],"high":[53],"by":[57],"different":[59],"method.":[60]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}