Repository landing page
research
Optimal prefix codes for pairs of geometrically-distributed random variables
Abstract
38 pagesInternational audienceOptimal 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- info:eu-repo/semantics/article
- Journal articles
- decoding
- encoding
- random processes
- statistical distributions
- Codes for countable alphabets
- Golomb codes
- Huffman codes
- geometric distributions
- lossless compression
- prefix codes
- [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
- [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]
- [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]