Learn 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)