\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
A source $S = \{S_1, S_2,...\}$ having a binary Huffman code with
code-word lengths satisfying $l_1 = 1, l_2 = 2, ...$ is called an
antiuniform source. If $l_1 = 1, l_2 = 2, ... , l_i = i$, then the
source is called an i-level partially antiuniform source. This
paper deals with the redundancy, expected codeword length and
entropy of antiuniform sources. A tight upper bound is derived for
the expected codeword length $L$ of antiuniform sources. It is
shown that $L$ does not exceed $\frac{\sqrt{5}+3}{2}$. For each $1
< L \leq \frac{\sqrt{5}+3}{2}$ we introduce an antiuniform
distribution achieving maximum entropy $H$(P)max =
LlogL-(L-l)log(L-l). This shows that the maximum entropy achieved
by antiuniform distributions does not exceed 2.512. It is shown
that the range of redundancy values for $i$-level partially
antiuniform sources with distribution $\{Pi\}$ is an interval of
length $\sum_{j=i+1}Pj$. This results in a realistic approximation
for the redundancy of these sources.
\end{document}