@article{DBLP:journals/tit/AustrinKKN18,
  author    = {Per Austrin and
               Petteri Kaski and
               Mikko Koivisto and
               Jesper Nederlof},
  title     = {Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs},
  journal   = {{IEEE} Trans. Information Theory},
  volume    = {64},
  number    = {2},
  pages     = {1368--1373},
  year      = {2018},
  url       = {https://doi.org/10.1109/TIT.2017.2688378},
  doi       = {10.1109/TIT.2017.2688378},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tit/AustrinKKN18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"gNLp9EdKrYQCSTiDm","bibbaseid":"austrin-kaski-koivisto-nederlof-sharperupperboundsforunbalanceduniquelydecodablecodepairs-2018","downloads":0,"creationDate":"2018-12-05T09:14:34.472Z","title":"Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs","author_short":["Austrin, P.","Kaski, P.","Koivisto, M.","Nederlof, J."],"year":2018,"bibtype":"article","biburl":"https://dblp.org/pid/33/7187.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Per"],"propositions":[],"lastnames":["Austrin"],"suffixes":[]},{"firstnames":["Petteri"],"propositions":[],"lastnames":["Kaski"],"suffixes":[]},{"firstnames":["Mikko"],"propositions":[],"lastnames":["Koivisto"],"suffixes":[]},{"firstnames":["Jesper"],"propositions":[],"lastnames":["Nederlof"],"suffixes":[]}],"title":"Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs","journal":"IEEE Trans. Information Theory","volume":"64","number":"2","pages":"1368–1373","year":"2018","url":"https://doi.org/10.1109/TIT.2017.2688378","doi":"10.1109/TIT.2017.2688378","timestamp":"Fri, 02 Nov 2018 00:00:00 +0100","biburl":"https://dblp.org/rec/bib/journals/tit/AustrinKKN18","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/tit/AustrinKKN18,\n author = {Per Austrin and\n Petteri Kaski and\n Mikko Koivisto and\n Jesper Nederlof},\n title = {Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs},\n journal = {{IEEE} Trans. Information Theory},\n volume = {64},\n number = {2},\n pages = {1368--1373},\n year = {2018},\n url = {https://doi.org/10.1109/TIT.2017.2688378},\n doi = {10.1109/TIT.2017.2688378},\n timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/journals/tit/AustrinKKN18},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Austrin, P.","Kaski, P.","Koivisto, M.","Nederlof, J."],"key":"DBLP:journals/tit/AustrinKKN18","id":"DBLP:journals/tit/AustrinKKN18","bibbaseid":"austrin-kaski-koivisto-nederlof-sharperupperboundsforunbalanceduniquelydecodablecodepairs-2018","role":"author","urls":{"Paper":"https://doi.org/10.1109/TIT.2017.2688378"},"downloads":0},"search_terms":["sharper","upper","bounds","unbalanced","uniquely","decodable","code","pairs","austrin","kaski","koivisto","nederlof"],"keywords":[],"authorIDs":[],"dataSources":["qoaa8S6oo6iCH58av"]}