### Table 3. Higher Weight Enumerators of the Projective Plane of Order 4

"... In PAGE 7: ...3. The weight enumerators are given in Table3 . We list only the code since the weight enumerators of the Hull can be read from these weight enumerators.... ..."

### Table 1. Higher Weight Enumerators of the code and the Hull of the Projective Plane of Order 3

"... In PAGE 4: ... We require a bit more to determine the higher weight enumerators of the biplane of order 3, but we compute it later. The higher weights of the projective plane are given in Table1 and for the biplane are given Table 8. Table 1.... ..."

### Table 2. Higher Weight Enumerators of the Projective Plane of Order 2

### Table 4. Ordering enumeration inc .

Cited by 1

### Table 4. Table 4. Higher Weight Enumerator of the Biplane of Order 2

### Table 2: Seidel (3rd order) terms tted to wavefronts by rayGetPlanes()

"... In PAGE 8: ... struct Node *rayGetPlanes( /* return list of planes */ struct Node *RayBundleSet, /* list of lists of rays */ double yz_axis[], /* Zernike analysis axis */ double yz_radius, /* Zernike radius */ char print_mode[]) /* quot;verbose quot;| quot;silent quot; */ For the analysis of nearly-planar wavefronts, we need to t the pathlengths of rays across the aperture with Zernike polynomials [BW59], and identify the terms which represent the primary (Seidel) aberrations. The argument nord to function mathZernike() in rayGetPlanes() is int nord[]=4,3,2,-1; /* max orders for Seidel abberations */, which will command mathZernike()9 to compute the nine terms shown in Table2 (cf. Table 6).... ..."

### Table 4 Results of the plane registration portion of the projection device calibration, giving a measure for the repeatability of the plane parameter registration.

### Table 3. Normalized plane functions for some self-dual planes of order 16

"... In PAGE 8: ... It might be noted that one of the planes produced is not a translation plane, namely MATH. Representative normalized plane functions are given for the three self-dual planes in Table3 and for the six non-self-dual planes in Table 4. Since only the additive structure of F16 is involved, the eld can be regarded as F4 2 under addition, and its elements thus correspond in a natural way to the numbers 0;:::;15.... ..."

Cited by 1

### Table 1: Efficiency on vertex enumeration (continued)

"... In PAGE 24: ... It should be noted that strictly speaking, lrslib solves a slightly different, easier problem than the one solved by the other systems: while the latter guarantee the result is minimized, the output of lrslib may contain duplicate rays. Table1 : Efficiency on vertex enumeration input PPL New Polka PolyLib cddlib lrslib pd ccc4.e 0.... In PAGE 26: ...Table1 : Efficiency on vertex enumeration (continued) input PPL New Polka PolyLib cddlib lrslib pd project2_m.i 0.... ..."

### Table 1: Efficiency on vertex enumeration (continued)

"... In PAGE 24: ... It should be noted that strictly speaking, lrslib solves a slightly different, easier problem than the one solved by the other systems: while the latter guarantee the result is minimized, the output of lrslib may contain duplicate rays. Table1 : Efficiency on vertex enumeration input PPL New Polka PolyLib cddlib lrslib pd ccc4.e 0.... In PAGE 26: ...Table1 : Efficiency on vertex enumeration (continued) input PPL New Polka PolyLib cddlib lrslib pd project2_m.i 0.... ..."