View File - University of Engineering and Technology, Taxila

can be seen in Table 6.1 that the minimum weight is 3 and the minimumdistance is also 3.Rule 2: The number of errors that can be detected in a code withminimum distance isn d ¼ d H;min 1 ð6:23ÞThe number of errors that can be counted to the next-lowest integer isn c ¼ d H;min 1=2 ¼ n d =2 ð6:24ÞFor example, from Table 6.1:The minimum distance d H;min ¼ 3:The number of errors that can be detected n d ¼ 2.The number of errors that can be counted n c ¼ 1.Example 6.3 has demonstrated that detecting more than two bits that arein error becomes more difficult. This limits the use of the general rules for thelinear block coding technique.TABLE 6.1 Codewords and Weights for the (7,4)Hamming CodeMessage bits, X Codeword, Y Weight, w H0000 0000000 —0001 0001011 30010 0010101 30011 0011110 40100 0100110 30101 0101101 40110 0110011 40111 0111000 31000 1000111 41001 1001100 31010 1010010 31011 1011001 41100 1100001 31101 1101010 41110 1110100 41111 1111111 7Copyright © 2002 by Marcel Dekker, Inc. All Rights Reserved.