{"id":"https://openalex.org/W2022350090","doi":"https://doi.org/10.1145/2090236.2090250","title":"Towards deterministic tree code constructions","display_name":"Towards deterministic tree code constructions","publication_year":2012,"publication_date":"2012-01-08","ids":{"openalex":"https://openalex.org/W2022350090","doi":"https://doi.org/10.1145/2090236.2090250","mag":"2022350090"},"language":"en","primary_location":{"id":"doi:10.1145/2090236.2090250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2090236.2090250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","raw_type":"proceedings-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/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["CA","US"],"is_corresponding":true,"raw_author_name":"Mark Braverman","raw_affiliation_strings":["Princeton University and the University of Toronto","Princeton University and the University of Toronto#TAB#"],"affiliations":[{"raw_affiliation_string":"Princeton University and the University of Toronto","institution_ids":["https://openalex.org/I20089843","https://openalex.org/I185261750"]},{"raw_affiliation_string":"Princeton University and the University of Toronto#TAB#","institution_ids":["https://openalex.org/I20089843","https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042816355"],"corresponding_institution_ids":["https://openalex.org/I185261750","https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":8.5103,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.97951343,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"161","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.996999979019165,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9968000054359436,"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/tree","display_name":"Tree (set theory)","score":0.7608435153961182},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6052201986312866},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5303046703338623},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.515796422958374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5076552629470825},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.488768070936203},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.449991375207901},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42020896077156067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4102059006690979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3842783570289612},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35907524824142456},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3568059504032135},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.346121609210968},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2458065152168274},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2177739143371582},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08633214235305786}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7608435153961182},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6052201986312866},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5303046703338623},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.515796422958374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5076552629470825},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.488768070936203},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.449991375207901},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42020896077156067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4102059006690979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3842783570289612},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35907524824142456},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3568059504032135},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.346121609210968},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2458065152168274},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2177739143371582},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08633214235305786},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2090236.2090250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2090236.2090250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W769408","https://openalex.org/W226315685","https://openalex.org/W1553643114","https://openalex.org/W1606480398","https://openalex.org/W2014860393","https://openalex.org/W2026670837","https://openalex.org/W2045377861","https://openalex.org/W2115551261","https://openalex.org/W2293231900"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W22108090","https://openalex.org/W2107381954","https://openalex.org/W2351720606","https://openalex.org/W1521720839","https://openalex.org/W2156833871","https://openalex.org/W1488047477","https://openalex.org/W2058600246","https://openalex.org/W2484254769","https://openalex.org/W1601483509"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,25,64],"deterministic":[3,52],"operator":[4],"on":[5],"tree":[6,11,22,27,33,57,65],"codes":[7,23,34],"--":[8,14],"we":[9,59],"call":[10],"code":[12,66],"product":[13],"that":[15],"allows":[16,46],"one":[17],"to":[18,48,62],"deterministically":[19],"combine":[20],"two":[21],"into":[24],"larger":[26],"code.":[28],"Moreover,":[29,74],"if":[30],"the":[31,50],"original":[32],"are":[35,60],"efficiently":[36],"encodable":[37,78],"and":[38,79],"decodable,":[39],"then":[40],"so":[41],"is":[42,76],"their":[43],"product.":[44],"This":[45],"us":[47],"give":[49],"first":[51],"subexponential-time":[53],"construction":[54],"of":[55,68],"explicit":[56],"codes:":[58],"able":[61],"construct":[63],"T":[67,75],"size":[69],"n":[70],"in":[71,81],"time":[72,82],"2n\u03b5,.":[73,83],"also":[77],"decodable":[80]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}