Optimal prefix codes for pairs of geometrically-distributed random variables
Résumé
Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter q, 0
= 1), covering the range q>=1/2, and q=1/2 (k>1), covering the range q<1/2. The described codes produce the expected reduction in redundancy with respect to the one-dimensional case, while maintaining low complexity coding operations.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...