### Table 5: Parameters of generalized Gray image of extended Hensel lift of QR(n) (left) and minimum distance of the best known linear codes of same length and size (right).

2003

"... In PAGE 6: ... Following this work, we lifted generating polynomial of QR(n) for n = 17, 23, 31, 47 to Z8 and Z16, extended the resulting codes by a parity-check sym- bol, then computed their minimum distance with computer assistance. Results are shown in Table5 , bold (resp. italic) is for codes better than (resp.... ..."

Cited by 1

### Table 7: Minimum Distance supervised classification accuracy assessment (n=23) Satellite

2004

"... In PAGE 31: ... The statistics show that there are no significant differences, in the produced map accuracies, between any of the maps and therefore it cannot be said that the increased spatial resolution and the spectral bands of the Aster image improves the classification of the lichen fields using supervised classification. The z test (Table 6 and Table7 ), used to test the hypothesis that the produced maps are in fact better than a random assigning of pixels, is significant at the 95% confidence limit for the August Landsat image (bands 245) produced using a ML classification and the Aster image (All Bands) produced using a MD classifier. For the remainder of the classified maps it cannot be said that using either a ML or MD classifier is any better than randomly assigning a class to a pixel.... ..."

### Table 2: Minimum distances and CPU times

2000

"... In PAGE 16: ...AM, 70MHz, 204.7 mips, 44.4 M ops. We ran both codes using 50 initial random points for each problem. The results are summarized in Table2 . This table lists the eigtheen problems with the number of variables and constraints and the statistic information related to the minimum distance between two points (minimum, maximum, average) and CPU time (minimum,maximum, average) using the Inexact{Restoration algorithm ( rst row of each set) and the ones using LANCELOT (second row).... In PAGE 16: ...roblem. The results are summarized in Table 2. This table lists the eigtheen problems with the number of variables and constraints and the statistic information related to the minimum distance between two points (minimum, maximum, average) and CPU time (minimum,maximum, average) using the Inexact{Restoration algorithm ( rst row of each set) and the ones using LANCELOT (second row). The information contained in Table2 is depicted graphically below. The intervals (min, max) of distances/log(CPU times) are represented by vertical segments, the averages are indicated with... ..."

Cited by 11

### Table 3: Minimum distance for square S-random inter- leavers.

2003

"... In PAGE 4: ... To reinforce this comparison, we have also evaluated the minimum distances of the five different code configurations using the exact algorithm in [10]. The results are reported in Table3 , and show that our technique yields the same minimum distance as the ad-hoc one, while the technique in [8] leads to a significant reduction. Also in terms of free distance, the interleavers generated with our technique seem also to outperform the ones described in the UMTS stan- dard.... ..."

Cited by 1

### Table 1 Comparison of various Disguised event representation to the classifier events. Minimum distance is highlighted.

"... In PAGE 5: ... Table1 shows the distance between each of the disguised events (columns) and the classifier events (rows). Highlighted cells indicate the minimum distance classifier event, whose label the system will use to label the disguised event.... ..."

### TABLE I ESTIMATED MINIMUM DISTANCE AND MULTIPLICITY OF SOME WELL-KNOWN LDPC CODES USING THE ANC APPROACH.

2004

Cited by 3

### TABLE 6. MINIMUM DISTANCE FROM EMITTER TO AIRCRAFT USED IN CALCULATION OF FIELD STRENGTHS

1999

### TABLE 6. MINIMUM DISTANCE FROM EMITTER TO AIRCRAFT USED IN CALCULATION OF FIELD STRENGTHS

1999

### Table 2. Empirical and limiting variances of pn n in the minimum distance method, G(x) = (x); and = 0.

"... In PAGE 16: ...700 a) Reported from Parr and Schucany (1980). Table2 contains variances of pn n = pn ( ^ Fn; G n) and complements the results listed in Table 1. The rst three columns contain the empirical variances obtained from the same simulated data for = 0 as used for calculating the quantities in columns 2 ? 4 of Table 1.... In PAGE 16: ... The rst three columns contain the empirical variances obtained from the same simulated data for = 0 as used for calculating the quantities in columns 2 ? 4 of Table 1. In column 4 of Table2 we list the limiting theoretical variances of pn n. Table 2 shows that the small sample variances for F 6 = G are usually smaller than the limiting quantities, but much closer to the limit than was the case with the variance of pn n as reported in Table 1.... In PAGE 17: ... Rao et al (1975) considered an estimator of a center of symmetry based on the Kolmogorov- Smirnov distance. In Table2 they listed numbers referring to a comparison between some estimates of the length of con dence intervals for a symmetry center. The authors reported excellent behaviour of the minimum distance estimators in the case of the Cauchy distri- bution.... ..."

### Table 1 : Minimum distance separation matrix for pairs of aircraft simultaneously on final approach path, n.m.

1995

"... In PAGE 3: ... On the final approach path the minimum in- trail distance separations are a function of both aircraft weight class and landing order as determined by the FAA apos;s wake vortex safety rules. Table1 gives the values in matrix format. The table also gives examples of aircraft models falling in the different weight categories.... In PAGE 3: ... Such aircraft do not contribute a large fraction of traffic at hub airports and therefore are not included. They could be included in Table1 by adding a fourth row and column. As before, the distance separation in Table 1 must be converted to equivalent time separation for use by the scheduler.... ..."

Cited by 14