{"id":"https://openalex.org/W2122967654","doi":"https://doi.org/10.1109/tit.2014.2307062","title":"Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding","display_name":"Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding","publication_year":2014,"publication_date":"2014-02-20","ids":{"openalex":"https://openalex.org/W2122967654","doi":"https://doi.org/10.1109/tit.2014.2307062","mag":"2122967654"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2014.2307062","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2307062","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01079327/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041609088","display_name":"Andr\u00e1s Gy\u00f6rgy","orcid":"https://orcid.org/0000-0003-0586-4337"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]},{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["CA","HU"],"is_corresponding":true,"raw_author_name":"Andras Gyorgy","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, AB, Canada","Machine Learning Res. Group, Comput. & Autom. Res. Inst., Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Machine Learning Res. Group, Comput. & Autom. Res. Inst., Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077167635","display_name":"Gergely Neu","orcid":"https://orcid.org/0000-0001-6287-3796"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gergely Neu","raw_affiliation_strings":["Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary","Dept. of Comput. Sci. & Inf. Theor., Budapest Univ. of Technol. & Econ., Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Theor., Budapest Univ. of Technol. & Econ., Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041609088"],"corresponding_institution_ids":["https://openalex.org/I154425047","https://openalex.org/I4210117195"],"apc_list":null,"apc_paid":null,"fwci":0.8408,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7936738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"60","issue":"5","first_page":"2823","last_page":"2834"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9979000091552734,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6529773473739624},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.6188355088233948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5654536485671997},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.558154821395874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5481961965560913},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5267569422721863},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4594472646713257},{"id":"https://openalex.org/keywords/rate\u2013distortion-theory","display_name":"Rate\u2013distortion theory","score":0.4576297402381897},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4243074059486389},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41498637199401855},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.40504419803619385},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.4018787741661072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35881873965263367},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3375350534915924},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17204952239990234},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0951559841632843}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6529773473739624},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.6188355088233948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5654536485671997},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.558154821395874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5481961965560913},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5267569422721863},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4594472646713257},{"id":"https://openalex.org/C64185310","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate\u2013distortion theory","level":3,"score":0.4576297402381897},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4243074059486389},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41498637199401855},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.40504419803619385},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.4018787741661072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35881873965263367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3375350534915924},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17204952239990234},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0951559841632843},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2014.2307062","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2307062","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01079327v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01079327","pdf_url":"https://hal.science/hal-01079327/document","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 2014, pp.2823-2834. &#x27E8;10.1109/TIT.2014.2307062&#x27E9;","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01079327v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01079327","pdf_url":"https://hal.science/hal-01079327/document","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 2014, pp.2823-2834. &#x27E8;10.1109/TIT.2014.2307062&#x27E9;","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8284766523","display_name":null,"funder_award_id":"(NSERC)","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320322193","display_name":"Nemzeti Kutat\u00e1si \u00e9s Technol\u00f3giai Hivatal","ror":"https://ror.org/03g2am276"},{"id":"https://openalex.org/F4320325651","display_name":"Alberta Innovates","ror":null},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2122967654.pdf","grobid_xml":"https://content.openalex.org/works/W2122967654.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W177617673","https://openalex.org/W1527666879","https://openalex.org/W1537994635","https://openalex.org/W1570963478","https://openalex.org/W2093825590","https://openalex.org/W2096352571","https://openalex.org/W2098123283","https://openalex.org/W2129962685","https://openalex.org/W2132652091","https://openalex.org/W2133238387","https://openalex.org/W2133472798","https://openalex.org/W2137154577","https://openalex.org/W2148649706","https://openalex.org/W2158455534","https://openalex.org/W2611627047","https://openalex.org/W3149261725","https://openalex.org/W4248175720","https://openalex.org/W6607198235","https://openalex.org/W6680067965"],"related_works":["https://openalex.org/W2547124190","https://openalex.org/W2385628723","https://openalex.org/W2888954728","https://openalex.org/W2552401318","https://openalex.org/W108076602","https://openalex.org/W3180760233","https://openalex.org/W4384342390","https://openalex.org/W3035703949","https://openalex.org/W4247601675","https://openalex.org/W1033938421"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,12,22,37,40,44,49,54,64,69,93,103,107,118,128,132,152,155,186,194,214,228,237,252,264,279,291,307],"problem":[3,215,265],"of":[4,8,32,43,48,61,86,109,124,177,203,216,254,266,282,285,295],"limited-delay":[5],"lossy":[6],"coding":[7,33,51,145,219,315],"individual":[9],"sequences.":[10],"Here,":[11],"goal":[13],"is":[14,96,106,121,169,191,210,233,260,275],"to":[15,20,28,82,99,139,173,213,227,236,263,278,312],"design":[16],"(fixed-rate)":[17],"compression":[18,163],"schemes":[19,66,316],"minimize":[21],"normalized":[23,78,166,272],"expected":[24],"distortion":[25,42,79,119,167,273],"redundancy":[26,80,95,120,168,274],"relative":[27,81,172,277],"a":[29,59,162,181,201,221,255,286],"reference":[30,55,84,104,144,178],"class":[31,105,176,281],"schemes,":[34,179],"measured":[35],"as":[36,250],"difference":[38],"between":[39,154],"average":[41,206],"algorithm":[45,209],"and":[46,89,92,131,157,160,226,306],"that":[47,117],"best":[50,65],"scheme":[52,164],"in":[53,68,127,251,318],"class.":[56],"In":[57,147],"compressing":[58],"sequence":[60],"length":[62],"T,":[63],"available":[67,235],"literature":[70],"achieve":[71],"an":[72],"O(T":[73],"<sup":[74],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-1/3</sup>":[76],")":[77],"finite":[83,175],"classes":[85],"limited":[87,90],"delay":[88],"memory,":[91],"same":[94,243],"achievable,":[97],"up":[98],"logarithmic":[100,182],"factors,":[101],"when":[102,230],"set":[108],"scalar":[110,268,283,304],"quantizers.":[111],"It":[112],"has":[113],"also":[114,211,234,261],"been":[115],"shown":[116],"at":[122],"least":[123],"order":[125,296],"1/\u221aT":[126],"latter":[129],"case,":[130],"lower":[133,158,187,293],"bound":[134,294],"can":[135],"easily":[136],"be":[137],"extended":[138,212],"sufficiently":[140],"powerful":[141],"(possibly":[142],"finite)":[143],"schemes.":[146],"this":[148,319],"paper,":[149],"we":[150],"narrow":[151],"gap":[153],"upper":[156],"bounds,":[159],"give":[161],"whose":[165],"O(\u221a(ln":[170],"(T)/T)":[171],"any":[174],"only":[180],"factor":[183],"larger":[184],"than":[185],"bound.":[188],"The":[189,208,242,298],"method":[190,259],"based":[192],"on":[193],"recently":[195],"introduced":[196],"shrinking":[197],"dartboard":[198],"prediction":[199],"algorithm,":[200],"variant":[202],"exponentially":[204],"weighted":[205],"prediction.":[207],"joint":[217],"source-channel":[218],"over":[220,311],"(known)":[222],"stochastic":[223],"noisy":[224],"channel":[225],"case":[229,253],"side":[231],"information":[232],"decoder":[238],"(the":[239],"Wyner-Ziv":[240,308],"setting).":[241],"improvements":[244],"are":[245],"obtained":[246],"for":[247,303],"these":[248],"settings":[249],"noiseless":[256],"channel.":[257],"Our":[258],"applied":[262],"zero-delay":[267],"quantization,":[269],"where":[270],"O(\\ln(T)/1/\u221aT":[271],"achieved":[276],"(infinite)":[280],"quantizers":[284],"given":[287],"rate,":[288],"almost":[289],"achieving":[290],"known":[292,302],"1/\u221aT.":[297],"computationally":[299],"efficient":[300],"algorithms":[301],"quantization":[305],"setting":[309],"carry":[310],"our":[313],"(improved)":[314],"presented":[317],"paper.":[320]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}