Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Efficient Run-length Encoding Of Binary Sources With Unknown Statistics|
|Abstract:||An 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.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.