Non-zero weights

We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to n 900.A partition of weight n is a nonincreasing sequence of nonnegative integers (1, 2, . . . , k, . . .) whose sum is n. The weight is denoted by ||. The number of nonzero elements in the sequence is the length of the partition denoted by l(). The set of all partitions of weight n is denoted by P(n).

17p thulanh5 12-09-2011 49 3   Download

Convolutional codes are linear. Therefore, the Hamming distance between any pair of code sequences corresponds to the Hamming distance between the allzero code sequence and some nonzero code sequence. The nonzero sequence of minimum Hamming weight diverges from the allzero path at some point and remerges with the allzero path at some later point

22p stevenhuynh87 08-12-2010 113 3   Download