{"id":"https://openalex.org/W2744279216","doi":"https://doi.org/10.1109/isit.2017.8006880","title":"The redundancy gains of almost lossless universal source coding over envelope families","display_name":"The redundancy gains of almost lossless universal source coding over envelope families","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2744279216","doi":"https://doi.org/10.1109/isit.2017.8006880","mag":"2744279216"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006880","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"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/A5074503710","display_name":"Jorge F. Silva","orcid":"https://orcid.org/0000-0002-0256-282X"},"institutions":[{"id":"https://openalex.org/I4210086410","display_name":"Universidad Bernardo O'Higgins","ror":"https://ror.org/00x0xhn70","country_code":"CL","type":"education","lineage":["https://openalex.org/I4210086410"]},{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Jorge F. Silva","raw_affiliation_strings":["Information and Decision System Group (IDS), Universidad de Chile, Santiago, Chile","UCHILE - Universidad de Chile = University of Chile [Santiago] (Av. Libertador Bernardo O'Higgins 1058, Santiago de Chile - Chile)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information and Decision System Group (IDS), Universidad de Chile, Santiago, Chile","institution_ids":["https://openalex.org/I69737025"]},{"raw_affiliation_string":"UCHILE - Universidad de Chile = University of Chile [Santiago] (Av. Libertador Bernardo O'Higgins 1058, Santiago de Chile - Chile)","institution_ids":["https://openalex.org/I4210086410","https://openalex.org/I69737025"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071189599","display_name":"Pablo Piantanida","orcid":"https://orcid.org/0000-0002-8717-2117"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210097418","display_name":"Laboratoire des signaux et syst\u00e8mes","ror":"https://ror.org/00skw9v43","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210097418","https://openalex.org/I4210107720"]},{"id":"https://openalex.org/I4210107720","display_name":"CentraleSup\u00e9lec","ror":"https://ror.org/019tcpt25","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I4210107720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pablo Piantanida","raw_affiliation_strings":["Laboratoire des Signaux et Systemes (L2S), CentraleSupelec-CNRS-Universite Paris Sud, Gif-sur-Yvette, France","L2S - Laboratoire des signaux et syst\u00e8mes (Plateau de Moulon 3 rue Joliot Curie 91192 GIF SUR YVETTE CEDEX - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire des Signaux et Systemes (L2S), CentraleSupelec-CNRS-Universite Paris Sud, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I4210107720"]},{"raw_affiliation_string":"L2S - Laboratoire des signaux et syst\u00e8mes (Plateau de Moulon 3 rue Joliot Curie 91192 GIF SUR YVETTE CEDEX - France)","institution_ids":["https://openalex.org/I4210097418"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2003","last_page":"2007"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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.9991000294685364,"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/lossless-compression","display_name":"Lossless compression","score":0.8543868064880371},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5912289619445801},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5540845394134521},{"id":"https://openalex.org/keywords/context-adaptive-variable-length-coding","display_name":"Context-adaptive variable-length coding","score":0.4830385148525238},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4284241795539856},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.42311370372772217},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4116152226924896},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.38018798828125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3620678186416626},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.30415427684783936},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.225953608751297},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10095870494842529}],"concepts":[{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.8543868064880371},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5912289619445801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5540845394134521},{"id":"https://openalex.org/C135534801","wikidata":"https://www.wikidata.org/wiki/Q1128721","display_name":"Context-adaptive variable-length coding","level":4,"score":0.4830385148525238},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4284241795539856},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.42311370372772217},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4116152226924896},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.38018798828125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3620678186416626},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30415427684783936},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.225953608751297},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10095870494842529},{"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2017.8006880","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01742332v1","is_oa":false,"landing_page_url":"https://centralesupelec.hal.science/hal-01742332","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT), Jun 2017, Aachen, France. ⟨10.1109/ISIT.2017.8006880⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971619812","https://openalex.org/W1990645294","https://openalex.org/W2027808690","https://openalex.org/W2055309977","https://openalex.org/W2123744935","https://openalex.org/W2123838014","https://openalex.org/W2160474927","https://openalex.org/W2164783098","https://openalex.org/W2165206768","https://openalex.org/W2518012022","https://openalex.org/W3099411104","https://openalex.org/W3105867923"],"related_works":["https://openalex.org/W2354884987","https://openalex.org/W2383844503","https://openalex.org/W2767609558","https://openalex.org/W2131702615","https://openalex.org/W2393904146","https://openalex.org/W2110189477","https://openalex.org/W2129768577","https://openalex.org/W2141441222","https://openalex.org/W2473084587","https://openalex.org/W2167897635"],"abstract_inverted_index":{"The":[0],"problem":[1,104],"of":[2,16,25,41,61,96,98,105,119,128,144,164,199,201],"almost":[3,34,85,106,137,188],"lossless":[4,35,56,80,86,107,138,159,183,189],"universal":[5,108],"coding":[6,36,109,139],"is":[7,82,110,185],"revisited":[8,111],"in":[9,112],"this":[10,113],"work.":[11,114],"We":[12,115],"study":[13,116],"uniform":[14,117],"rate":[15,40,118,143],"convergence":[17,42,97,120,145,200],"for":[18,43,54,121,146,157],"distortion":[19,65,122,168],"and":[20,123],"redundancy":[21,46,100,124,149,203],"over":[22,125],"a":[23,63,126,166],"family":[24,127],"envelope":[26,129],"distributions.":[27,130],"In":[28,131],"particular,":[29,132],"we":[30,133],"show":[31,76,134,179],"that":[32,66,77,135,169,180],"an":[33,84,136,187],"scheme":[37,87,140,190],"offers":[38,141],"faster":[39,142],"the":[44,49,55,59,71,94,99,102,147,152,158,162,174,197,202,205],"(minimax)":[45,148],"compared":[47,150],"with":[48,151],"well-known":[50,153],"information":[51,154],"radius":[52,155],"developed":[53,156],"case":[57,160],"at":[58,161],"expense":[60,163],"tolerating":[62,165],"non-zero":[64,167],"vanishes":[67,170],"to":[68,171],"zero":[69,172],"as":[70,173],"block-length":[72,175],"grows.":[73,176],"Our":[74,177],"results":[75,178],"even":[78,181],"when":[79,182],"universality":[81,184],"feasible,":[83,186],"can":[88,191],"still":[89,192],"offer":[90,193],"different":[91,194],"regimes":[92,195],"on":[93,196],"rates":[95,198],"versus":[101,204],"distortion.The":[103],"distortion.":[206]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}