Efficient Run-length Encoding Of Binary Sources With Unknown Statistics

dc.creatorCosta M.H.M.
dc.creatorMalvar H.S.
dc.date2004
dc.date2015-06-26T14:24:27Z
dc.date2015-11-26T14:13:37Z
dc.date2015-06-26T14:24:27Z
dc.date2015-11-26T14:13:37Z
dc.date.accessioned2018-03-28T21:14:25Z
dc.date.available2018-03-28T21:14:25Z
dc.identifier
dc.identifierData Compression Conference Proceedings. , v. , n. , p. 534 - , 2004.
dc.identifier10680314
dc.identifier
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-2642537058&partnerID=40&md5=d1b3b9334656a3e2854e1e715a48c96b
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/94464
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/94464
dc.identifier2-s2.0-2642537058
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1242336
dc.descriptionAn efficient run-length encoding of binary sources with unknown statistics was discussed. Binary entropy coders, which were used in multimedia codec standards and used adaptive Golomb-Rice coders, were also discussed. The uses of two subsets of Golomb parameters were also proposed. Polynomials whose roots were used to determine the optimal values of the Golomb parameters were derived. A nearly-optimal adaption strategy was derived, using a maximum-liklihood approach.
dc.description
dc.description
dc.description534
dc.description
dc.descriptionTanaka, H., Leon-Garcia, A., Efficient run-length encoding (1982) IEEE Trans. Information Theory, IT-28, pp. 880-890. , Nov
dc.descriptionCosta, M.H.M., Malvar, H.S., Efficient run-length encoding of binary sources with unknown statistics (2003) Microsoft Research Tech. Report, TR-2003-95. , Dec
dc.languageen
dc.publisher
dc.relationData Compression Conference Proceedings
dc.rightsfechado
dc.sourceScopus
dc.titleEfficient Run-length Encoding Of Binary Sources With Unknown Statistics
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución