### Table 4. Hamming Distance and Maximum Code Word Length

"... In PAGE 7: ... Execution Time for HS08 scription). The results are shown in Table4 . For each class of polynomials, the table shows the maximum code word length for which any polynomial of that class can achieve the stated HD.... ..."

### TABLE I Total information sequence Hamming distance cd of the minimum Hamming distance d codewords of continuous convolutional codes.

### Table 6: Comparison of output encoding methods for the Separate Phoneme/Stress approach. L is the length of the error-correcting code, and d is the minimum Hamming distance between each pair of codewords.

1999

"... In PAGE 7: ... We applied BCH code design methods (Bose amp; Ray-Chaudhuri, 1960; Hocquenghem, 1959; Lin amp; Costello, 1983) to design good error correcting codes of various lengths for both the separate and combined phoneme/stress con gurations. Table6 shows the results of the base con guration and the three alternative output encodings for the Separate Phoneme/Stress approach. Table 7 shows corresponding results for the Combined Phoneme/Stress approach.... ..."

Cited by 21

### Table 1. Binary and Gray coding. Gray coding ensures that consecutive numbers have Hamming distance 1.

1996

"... In PAGE 5: ... The coding problems discussed above can be relieved by using Gray coding. As can be seen in Table1 , Gray coding ensures that consecutive numbers have always Hamming distance of 1. This makes the optimization of any unimodal function much easier for the GA.... ..."

Cited by 11

### Table XVI gives the highest possible Hamming distance, Lee distance and Euclidean norm for codes over Z4 of lengths n 24. This is based on [71], [88], [95], [148], [238] and [253]. The columns headed # give the number of extremal codes. Remarks on Table XVI The length 16 code C16 is given in [238], where it is called 5 f5. It has jAut(C16)j = 25+10325:7 and generator matrix 2

### Table 2 Minimal inter-row and inter-column Ham- ming distances for our codes.

2000

Cited by 2

### TABLE I RATE 496177 CONVOLUTIONAL CODES WITH OPTIMAL FREE HAMMING DISTANCE AND FULL DIVERSITY IN ASYNCHRONOUS COOPERATIVE COMMUNICATION

### Table 2 Hamming distances in percents computed in the case of the window length of 13 amino acids between the classes of PPII and non-PPII, and within PPII.

"... In PAGE 10: ...for bit vectors, where xi and yi are the ith variables from the opposite classes. We computed Hamming distances for window lengths 5, 7, and 13, and results of the last case are presented in Table2 . It is difficult to separate between the two classes, because the mode (distance 8) of the PPII class is as far as in the non-PPII class.... ..."

### Table 6. Calculating the Theoretical accuracy for the ECOC with Hmin being the minimum row hamming distance and Emax being the maximum number of errors the code can correct.

2000

"... In PAGE 6: ... Then the probability of an instance being classified correctly would just follow the binomial distribution. Table6 shows the results of the calculation. Hmin is the minimum hamming distance the code used and since a code with minimum distance h can correct at least (h-1)/2 errors, Emax is the maximum number of errors the code can ... ..."

Cited by 22