{"id":"https://openalex.org/W2010509577","doi":"https://doi.org/10.1109/isit.2005.1523602","title":"Robust coding for uncertain sources: a minimax approach","display_name":"Robust coding for uncertain sources: a minimax approach","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2010509577","doi":"https://doi.org/10.1109/isit.2005.1523602","mag":"2010509577"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523602","doi":"https://doi.org/10.1109/isit.2005.1523602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523602","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5062301902","display_name":"Fatemeh Rezaei","orcid":"https://orcid.org/0000-0003-1260-5165","observed_orcids":["https://orcid.org/0000-0003-1260-5165"]},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"F. Rezaei","raw_affiliation_strings":["School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035087201","display_name":"Charalambos D. Charalambous","orcid":"https://orcid.org/0000-0002-2168-0231","observed_orcids":["https://orcid.org/0000-0002-2168-0231"]},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]},{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CA","CY"],"is_corresponding":false,"raw_author_name":"C.D. Charalambous","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus","School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus","institution_ids":["https://openalex.org/I34771391"]},{"raw_affiliation_string":"School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada","institution_ids":["https://openalex.org/I153718931"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2544,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.73469388,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1539","last_page":"1543"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9463000297546387,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9463000297546387,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.02199999988079071,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.018200000748038292,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/uniquely-decodable-codes","display_name":"uniquely decodable codes","score":0.8299999833106995},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.9909999966621399},{"id":"https://openalex.org/keywords/sensitivity-analysis","display_name":"sensitivity analysis","score":0.7089999914169312}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8165498375892639},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.7001312971115112},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6903636455535889},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.6585007309913635},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6534494161605835},{"id":"https://openalex.org/C1769480","wikidata":"https://www.wikidata.org/wiki/Q1345239","display_name":"Entropy encoding","level":3,"score":0.5863884687423706},{"id":"https://openalex.org/C177409962","wikidata":"https://www.wikidata.org/wiki/Q2411312","display_name":"Shannon's source coding theorem","level":5,"score":0.5264891982078552},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.5036880373954773},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.45396363735198975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43113973736763},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39884036779403687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3571518659591675},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.27038484811782837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25766581296920776},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2551451623439789},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.19570982456207275},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15160778164863586},{"id":"https://openalex.org/C44415725","wikidata":"https://www.wikidata.org/wiki/Q4913893","display_name":"Binary entropy function","level":3,"score":0.12447699904441833},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C49775889","wikidata":"https://www.wikidata.org/wiki/Q6795896","display_name":"Maximum entropy thermodynamics","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523602","doi":"https://doi.org/10.1109/isit.2005.1523602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523602","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1560089794","https://openalex.org/W1982955456","https://openalex.org/W2004276046","https://openalex.org/W2052719616","https://openalex.org/W2064533938","https://openalex.org/W2086264005","https://openalex.org/W2099111195","https://openalex.org/W2102098892","https://openalex.org/W2107676886","https://openalex.org/W2110084720","https://openalex.org/W2131024393","https://openalex.org/W2132119275","https://openalex.org/W2137902998","https://openalex.org/W2144237189","https://openalex.org/W2148574462","https://openalex.org/W2149306165","https://openalex.org/W2154518298","https://openalex.org/W3038470872","https://openalex.org/W3144644885"],"related_works":["https://openalex.org/W1940533598","https://openalex.org/W2101024038","https://openalex.org/W4416513759","https://openalex.org/W6888522691","https://openalex.org/W1967510719","https://openalex.org/W2041654521","https://openalex.org/W1637902389","https://openalex.org/W2111098540","https://openalex.org/W2928447401","https://openalex.org/W2076513425"],"abstract_inverted_index":{"This":[0,37],"paper":[1],"is":[2,30,65,80,146,172,199,241],"concerned":[3],"with":[4,23,123,138,164],"designing":[5],"minimum":[6],"average":[7,89,98],"length":[8,99,195,211],"uniquely":[9],"decodable":[10],"codes,":[11,167],"for":[12,18],"a":[13,26,41,69,83,141,175,193],"family":[14,128],"of":[15,90,95,114,129,212,222],"source":[16,43,62,77,130,170,196],"distributions":[17,224],"which":[19,47,86,120,145,202,225],"the":[20,48,52,56,60,75,88,96,133,161,165,169,180,188,203,210,213,220,227,237],"relative":[21,228],"entropy":[22,229],"respect":[24,124,139],"to":[25,40,82,110,117,125,140,187,207,216,233],"given":[27],"nominal":[28,143],"distribution":[29,171],"bounded":[31],"above":[32],"by":[33,236],"some":[34],"fixed":[35,194],"number.":[36],"formulation":[38],"leads":[39],"minimax":[42,76],"coding":[44,78,84,103,106,197],"problem,":[45],"in":[46,201],"minimizing":[49],"players":[50,58],"are":[51,59,108,136,157,183],"codeword":[53],"lengths,":[54],"while":[55,174],"maximizing":[57],"uncertain":[61,223],"distributions.":[63,131],"It":[64],"further":[66],"shown,":[67],"via":[68,153],"large":[70],"deviations":[71],"duality":[72],"relation,":[73],"that":[74,179],"problem":[79,85],"equivalent":[81],"minimizes":[87],"an":[91,126],"exponential":[92],"pay-off":[93],"instead":[94],"conventional":[97],"pay-off.":[100],"Both":[101],"Shannon":[102],"and":[104],"Huffman":[105],"methods":[107],"generalized":[109],"this":[111],"new":[112,181],"criterion":[113],"performance,":[115],"leading":[116],"robust":[118,166],"codes":[119,163,182,214],"perform":[121],"well":[122],"uncountable":[127],"However,":[132],"code":[134],"lengths":[135],"designed":[137],"known":[142],"distribution,":[144],"obtained":[147],"either":[148],"through":[149],"modeling":[150],"assumptions":[151],"or":[152],"empirical":[154],"techniques.":[155],"Simulations":[156],"also":[158],"presented":[159],"comparing":[160],"Shannon/Huffman":[162],"when":[168],"uncertain,":[173],"sensitivity":[176],"analysis":[177],"shows":[178],"much":[184],"less":[185],"sensitive":[186],"uncertainty":[189,234],"description.":[190],"In":[191],"addition,":[192],"theorem":[198],"derived":[200],"encoding":[204],"error":[205],"tends":[206,215],"zero":[208],"as":[209],"infinity,":[217],"uniformly":[218],"over":[219],"set":[221],"satisfy":[226],"bound.":[230],"Finally,":[231],"generalizations":[232],"described":[235],"total":[238],"variation":[239],"norm":[240],"discussed.":[242]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}