#### Filter Results:

#### Publication Year

1995

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

— A source S = {s1, s2, · · ·} having a binary Huffman code with codeword lengths satisfying l1 = 1, l2 = 2, · · ·(and ln−1 = ln = n − 1 when |S| = n) is called an antiuniform source. If l1 = 1, l2 = 2, · · ·, li = i, then the source is called an i-level partially antiuniform source. In this paper the redundancy, the expected codeword lengths, and the… (More)

—For q an odd prime and 1 m q, we study two binary qm 2 q 2 parity check matrices for binary array codes. For both parity check matrices, we determine the stopping distance and the minimum distance of the associated code for 2 m 3, and for (m; q) = (4; 5). In the case (m; q) = (4; 7), the stopping distance and the related minimum distance are also… (More)

—The problem of selecting a code for finite monotone sources with N symbols is considered. The selection criterion is based on minimizing the average redundancy (called Minave criterion) instead of its maximum (i.e., Minimax criterion). The average probability distribution P N , whose associated Huffman code has the minimum average redundancy, is derived.… (More)