{"id":"https://openalex.org/W2346812038","doi":"https://doi.org/10.1109/isit.2016.7541316","title":"Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs","display_name":"Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2346812038","doi":"https://doi.org/10.1109/isit.2016.7541316","mag":"2346812038"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Per Austrin","raw_affiliation_strings":["School of Computer Science and Communication, KTH Royal Institute of Technology, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Communication, KTH Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055721632","display_name":"Petteri Kaski","orcid":"https://orcid.org/0009-0002-3069-7753"},"institutions":[{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Petteri Kaski","raw_affiliation_strings":["Helsinki Institute for Information Technology HIIT, Department of Computer Science, Aalto University, Finland","Department of Computer Science, Aalto University, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki Institute for Information Technology HIIT, Department of Computer Science, Aalto University, Finland","institution_ids":["https://openalex.org/I32943570","https://openalex.org/I9927081"]},{"raw_affiliation_string":"Department of Computer Science, Aalto University, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088812539","display_name":"Mikko Koivisto","orcid":"https://orcid.org/0000-0001-9662-3605"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]},{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Mikko Koivisto","raw_affiliation_strings":["Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki, Finland","Department of Computer Science, Aalto University, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052","https://openalex.org/I32943570"]},{"raw_affiliation_string":"Department of Computer Science, Aalto University, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"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":"Jesper Nederlof","raw_affiliation_strings":["Department of Mathematics and Computer Science, Technical University of Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Technical University of Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5824,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66301543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"335","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9983000159263611,"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/T10237","display_name":"Cryptography and Data Security","score":0.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9883000254631042,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.599325954914093},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.53275465965271},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.49689987301826477},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34969452023506165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.290316104888916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25954827666282654},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0854586660861969}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.599325954914093},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.53275465965271},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.49689987301826477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34969452023506165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.290316104888916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25954827666282654},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0854586660861969},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","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":3,"locations":[{"id":"doi:10.1109/isit.2016.7541316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/b526f2c2-79ff-4dcb-8235-fed7831fcc8c","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/b526f2c2-79ff-4dcb-8235-fed7831fcc8c","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":"Austrin, P, Kaski, P, Koivisto, M & Nederlof, J 2016, Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. in IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016. Institute of Electrical and Electronics Engineers, Piscataway, pp. 335-339. https://doi.org/10.1109/ISIT.2016.7541316","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/b526f2c2-79ff-4dcb-8235-fed7831fcc8c","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/b526f2c2-79ff-4dcb-8235-fed7831fcc8c","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 International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, 335 - 339","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8399999737739563,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W298601666","https://openalex.org/W1577322816","https://openalex.org/W1592482298","https://openalex.org/W1847405718","https://openalex.org/W1915069679","https://openalex.org/W2039824753","https://openalex.org/W2061761364","https://openalex.org/W2065338886","https://openalex.org/W2094760650","https://openalex.org/W2105081412","https://openalex.org/W2121546896","https://openalex.org/W2123114258","https://openalex.org/W2123704833","https://openalex.org/W2137384791","https://openalex.org/W2149407563","https://openalex.org/W2163010692","https://openalex.org/W2171200795","https://openalex.org/W2346812038","https://openalex.org/W2963365260","https://openalex.org/W3173652044","https://openalex.org/W4206253867","https://openalex.org/W6610495740","https://openalex.org/W6635532581","https://openalex.org/W6639032334","https://openalex.org/W6797322502"],"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":{"Two":[0],"sets":[1],"A,":[2,18,38],"B":[3,21],"\u2286":[4],"{0,":[5],"1}nform":[6],"a":[7,16,23],"Uniquely":[8],"Decodable":[9],"Code":[10],"Pair":[11],"(UDCP)":[12],"if":[13],"every":[14,36],"pair":[15],"\u2208":[17,20],"b":[19],"yields":[22],"distinct":[24],"sum":[25],"a+b,":[26],"where":[27],"the":[28],"addition":[29],"is":[30],"over":[31],"\u2124n.":[32],"We":[33],"show":[34],"that":[35],"UDCP":[37],"B,":[39],"with":[40],"|A|":[41],"=":[42,45],"2(1\u2212\u03b5)nand":[43],"|B|":[44],"2\u03b2n,":[46],"satisfies":[47],"equation.":[48],"For":[49],"sufficiently":[50],"small":[51],"\u03b5,":[52],"this":[53],"bound":[54,75],"significantly":[55],"improves":[56],"previous":[57],"bounds":[58],"by":[59,77],"Urbanke":[60],"and":[61,67,69,79],"Li":[62],"[Information":[63],"Theory":[64],"Workshop":[65],"\u203298]":[66],"Ordentlich":[68],"Shayevitz":[70],"[2014,":[71],"arXiv:1412.8415],":[72],"which":[73],"upper":[74],"\u03b2":[76],"0.4921":[78],"0.4798,":[80],"respectively,":[81],"as":[82],"\u03b5":[83],"approaches":[84],"0.":[85]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}