dc.contributor.author Kontoyiannis, Ioannis dc.contributor.author Sezer, Ali Devin dc.date.accessioned 2019-01-17T00:31:07Z dc.date.available 2019-01-17T00:31:07Z dc.date.issued 2003 dc.identifier.isbn 978-3-0348-9428-9 dc.identifier.uri https://www.repository.cam.ac.uk/handle/1810/288115 dc.description.abstract Let A be finite set equipped with a probability distribution P, and let M be a “mass” function on A. A characterization is given for the most efficient way in which A n can be covered using spheres of a fixed radius. A covering is a subset C n of A n with the property that most of the elements of A n are within some fixed distance from at least one element of C n , and “most of the elements” means a set whose probability is exponentially close to one (with respect to the product distribution P n ). An efficient covering is one with small mass M n (C n ). With different choices for the geometry on A, this characterization gives various corollaries as special cases, including Marton’s error-exponents theorem in lossy data compression, Hoeffding’s optimal hypothesis testing exponents, and a new sharp converse to some measure concentration inequalities on discrete spaces. dc.publisher Springer dc.subject math.PR dc.subject math.PR dc.subject math.OC dc.title A Remark on Unified Error Exponents: Hypothesis Testing, Data Compression and Measure Concentration dc.type Book chapter prism.endingPage 32 prism.publicationDate 2003 prism.publicationName Stochastic Inequalities and Applications prism.startingPage 23 prism.volume 56 dc.identifier.doi 10.17863/CAM.35430 dcterms.dateAccepted 2002-01-15 rioxxterms.versionofrecord 10.1007/978-3-0348-8069-5_3 rioxxterms.version AM rioxxterms.licenseref.uri http://www.rioxx.net/licenses/all-rights-reserved rioxxterms.licenseref.startdate 2003 dc.contributor.orcid Kontoyiannis, Ioannis [0000-0001-7242-6375] dcterms.isPartOf Stochastic Inequalities and Applications rioxxterms.type Book chapter cam.orpheus.counter 20 rioxxterms.freetoread.startdate 2022-01-16
﻿