{"id":"https://openalex.org/W1982970231","doi":"https://doi.org/10.1109/isit.2006.262027","title":"R\u00e9nyi to R\u00e9nyi \u00bf Source Coding under Siege","display_name":"R\u00e9nyi to R\u00e9nyi \u00bf Source Coding under Siege","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W1982970231","doi":"https://doi.org/10.1109/isit.2006.262027","mag":"1982970231"},"language":"es","primary_location":{"id":"doi:10.1109/isit.2006.262027","doi":"https://doi.org/10.1109/isit.2006.262027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.262027","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":"2006 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"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/A5023602778","display_name":"Michael B. Baer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210097878","display_name":"Electronics for Imaging (United States)","ror":"https://ror.org/00zymfp03","country_code":"US","type":"company","lineage":["https://openalex.org/I4210097878"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Baer","raw_affiliation_strings":["Electronics for Imaging, Foster, CA, USA","Electronics for Imaging, 303 Velocity Way, Foster City, California 94404 USA. Email: Michael.Baer@efi.com"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electronics for Imaging, Foster, CA, USA","institution_ids":["https://openalex.org/I4210097878"]},{"raw_affiliation_string":"Electronics for Imaging, 303 Velocity Way, Foster City, California 94404 USA. Email: Michael.Baer@efi.com","institution_ids":["https://openalex.org/I4210097878"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023602778"],"corresponding_institution_ids":["https://openalex.org/I4210097878"],"apc_list":null,"apc_paid":null,"fwci":1.4366,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81243798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"6","issue":null,"first_page":"1258","last_page":"1262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T10901","display_name":"Advanced Data Compression Techniques","score":9.999999747378752e-05,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.0,"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/lossless-source-coding","display_name":"lossless source coding","score":0.9610000252723694},{"id":"https://openalex.org/keywords/unreliable-channels","display_name":"unreliable channels","score":0.6949999928474426},{"id":"https://openalex.org/keywords/renyi-entropy","display_name":"R\u00e9nyi entropy","score":0.7620000243186951},{"id":"https://openalex.org/keywords/dynamic-programming-algorithm","display_name":"dynamic programming algorithm","score":0.6880000233650208},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9959999918937683},{"id":"https://openalex.org/keywords/search-trees","display_name":"search trees","score":0.8370000123977661},{"id":"https://openalex.org/keywords/diagnostic-testing","display_name":"diagnostic testing","score":0.7900000214576721}],"concepts":[{"id":"https://openalex.org/C186857363","wikidata":"https://www.wikidata.org/wiki/Q188055","display_name":"Siege","level":2,"score":0.6874127984046936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.538007915019989},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.507628321647644},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.4489280581474304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4193876385688782},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3253445029258728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27163663506507874},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2521989345550537},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13537609577178955},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.07693001627922058},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2006.262027","doi":"https://doi.org/10.1109/isit.2006.262027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.262027","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":"2006 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.5324","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.5324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0602067v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, justice, and strong institutions"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1631150563","https://openalex.org/W1970171209","https://openalex.org/W1971227606","https://openalex.org/W1972376834","https://openalex.org/W1973527968","https://openalex.org/W1981134600","https://openalex.org/W1995875735","https://openalex.org/W1998631532","https://openalex.org/W2001935257","https://openalex.org/W2003564458","https://openalex.org/W2038649859","https://openalex.org/W2048616227","https://openalex.org/W2052719616","https://openalex.org/W2065954102","https://openalex.org/W2068373264","https://openalex.org/W2077623653","https://openalex.org/W2096900278","https://openalex.org/W2098155821","https://openalex.org/W2099111195","https://openalex.org/W2103424467","https://openalex.org/W2104740387","https://openalex.org/W2112710299","https://openalex.org/W2122882636","https://openalex.org/W2126711987","https://openalex.org/W2129920717","https://openalex.org/W2147680448","https://openalex.org/W2156745536","https://openalex.org/W2327767063","https://openalex.org/W2483679298","https://openalex.org/W2796236044","https://openalex.org/W2912096660","https://openalex.org/W3101263247","https://openalex.org/W4242936418","https://openalex.org/W4285719527","https://openalex.org/W6750060202"],"related_works":["https://openalex.org/W806177966","https://openalex.org/W3019057163","https://openalex.org/W2140335343","https://openalex.org/W2076883590","https://openalex.org/W2808323577","https://openalex.org/W4253072212","https://openalex.org/W2901162087","https://openalex.org/W2807914053","https://openalex.org/W2506888835","https://openalex.org/W2335251062"],"abstract_inverted_index":{"A":[0,209],"novel":[1,210,238],"lossless":[2,11],"source":[3,124],"coding":[4,125,176],"paradigm":[5,32],"applies":[6],"to":[7,23,27,36,51,63,69,73,104,121,186],"problems":[8],"of":[9,29,41,110,127,169,181,198,263],"unreliable":[10],"channels":[12],"with":[13,95,102],"low":[14],"bit":[15],"rates,":[16],"in":[17,45,66,112,184,203,230,248,253],"which":[18,46,178],"a":[19,47,135,148,166,243],"vital":[20],"message":[21],"needs":[22],"be":[24,34,163],"transmitted":[25],"prior":[26],"termination":[28],"communications.":[30],"This":[31],"can":[33,162,241],"applied":[35],"Alfred":[37],"Renyi's":[38],"secondhand":[39],"account":[40],"an":[42],"ancient":[43],"siege":[44,114,143],"spy":[48,61],"was":[49,56,93],"sent":[50],"scout":[52],"the":[53,60,91,113,122,142,217,222,251,260],"enemy":[54],"but":[55,107],"captured.":[57],"After":[58],"escaping,":[59],"returned":[62],"his":[64,88],"base":[65],"no":[67,156],"condition":[68],"speak":[70],"and":[71,90,206,233],"unable":[72],"write.":[74],"His":[75],"commander":[76],"asked":[77],"him":[78],"questions":[79],"that":[80],"he":[81],"could":[82],"answer":[83],"by":[84],"nodding":[85],"or":[86],"shaking":[87],"head,":[89],"fortress":[92],"defended":[94],"this":[96,100,160,199,228,264],"information.":[97],"Renyi":[98,182],"told":[99],"story":[101],"reference":[103],"prefix":[105],"coding,":[106],"maximizing":[108,146],"probability":[109],"survival":[111],"scenario":[115],"is":[116],"distinct":[117],"from":[118],"yet":[119],"related":[120],"traditional":[123,223],"objective":[126],"minimizing":[128,137],"expected":[129,138],"codeword":[130,139],"length.":[131],"Rather":[132],"than":[133],"finding":[134],"code":[136],"length":[140],"Xini=1p(i)l(i),":[141],"problem":[144,161,200,225,229,265],"involves":[145],"Xini=1p(i)thetasl(i)for":[147],"known":[149,167,187,219],"thetas":[150],"isin":[151],"(0,1).":[152],"When":[153],"there":[154],"are":[155,179,191,266],"restrictions":[157],"on":[158],"codewords,":[159],"solved":[164],"using":[165],"generalization":[168],"Huffman":[170],"coding.":[171],"The":[172,194],"optimal":[173],"solution":[174,245],"has":[175,201],"bounds":[177,190,258],"functions":[180],"entropy;":[183],"addition":[185],"bounds,":[188],"new":[189],"derived":[192],"here.":[193],"alphabetically":[195],"constrained":[196],"version":[197,262],"applications":[202],"search":[204],"trees":[205],"diagnostic":[207],"testing.":[208],"dynamic":[211],"programming":[212],"algorithm":[213,220],"-":[214,226],"based":[215],"upon":[216],"oldest":[218],"for":[221,259],"alphabetic":[224,261],"optimizes":[227],"O(n3)":[231],"time":[232],"O(n2)":[234],"space,":[235],"whereas":[236],"two":[237],"approximation":[239],"algorithms":[240],"find":[242],"suboptimal":[244],"faster:":[246],"one":[247],"linear":[249],"time,":[250],"other":[252],"O(n":[254],"log":[255],"n).":[256],"Coding":[257],"also":[267],"presented":[268]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}