{"id":"https://openalex.org/W2134792260","doi":"https://doi.org/10.1109/isit.2004.1365131","title":"Bounds on the expected cost of one-to-one codes","display_name":"Bounds on the expected cost of one-to-one codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2134792260","doi":"https://doi.org/10.1109/isit.2004.1365131","mag":"2134792260"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365131","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5009369454","display_name":"Serap A. Savari","orcid":"https://orcid.org/0000-0002-7451-4392"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S.A. Savari","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035516433","display_name":"A. Naheta","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Naheta","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009369454"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.7017,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.6756094,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"94","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.7605947256088257},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7302214503288269},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6856981515884399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5116665363311768},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4818512201309204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4320027828216553},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4005151093006134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3673689365386963},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.20452725887298584},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.06502857804298401}],"concepts":[{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.7605947256088257},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7302214503288269},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6856981515884399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5116665363311768},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4818512201309204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4320027828216553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4005151093006134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3673689365386963},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20452725887298584},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.06502857804298401},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365131","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1992600501","https://openalex.org/W2010288638","https://openalex.org/W2089272304","https://openalex.org/W2143603891","https://openalex.org/W2993383518","https://openalex.org/W6648982606"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2389793738","https://openalex.org/W2376208682","https://openalex.org/W2924107927","https://openalex.org/W2368886944","https://openalex.org/W4390358280","https://openalex.org/W2611966483","https://openalex.org/W4240806619","https://openalex.org/W4254609622","https://openalex.org/W2149931498"],"abstract_inverted_index":{"This":[0],"paper":[1],"generalizes":[2],"one-to-one":[3,35,48],"encodings":[4],"of":[5,32,45,62],"a":[6,52],"discrete":[7],"random":[8],"variable":[9],"to":[10,56],"finite":[11],"code":[12,49,67],"alphabets":[13],"with":[14],"memoryless":[15],"letter":[16],"costs":[17],"and":[18,22],"establish":[19],"some":[20],"upper":[21],"lower":[23,54],"bounds":[24],"on":[25],"the":[26,33,40,46,57,63],"expected":[27],"cost":[28,42,59],"per":[29,43,60],"source":[30],"symbol":[31,44,61],"best":[34],"codes.":[36],"We":[37],"show":[38],"that":[39],"average":[41,58],"optimal":[47,64],"sometimes":[50],"is":[51],"tighter":[53],"bound":[55],"uniquely":[65],"decodable":[66],"than":[68],"Shannon's":[69],"original":[70],"bound.":[71]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}