Unary prefixed Huffman coding for a group of quantized generalized Gaussian sources

We propose a coding algorithm called unary prefixed Huffman (UPH) coding for a family of infinite sources called quantized generalized Gaussian (GG) sources. Compared with the existing codes for these GG sources, the UPH algorithm provides a more adaptive approach, and its coding efficiency is upper bounded by entropy +2.