### Table 3: A ne parts of hyperovals in SEM2

"... In PAGE 6: ... (The collineation groups of these dual translation planes x the translation center !; this occurs as a \1 quot; in the orbit numbers and the orbit intersection number 0 below this \1 quot; indicates no hyperovals though !.) For SEM2 there are 18 hyperovals through !, (0) and (0,0), see [4], Table 9, and Table3 in the following section for an explicit list. All these results were con rmed by an independent computer search, see the following section.... In PAGE 7: ... As in [4] 18 hyperovals containing !, (0) and (0,0) were found in SEM2. The a ne points of the 18 hyperovals are listed in Table3 below. Each row represents a hyperoval and an entry j in column i means that the point (i; j) belongs... In PAGE 7: ...ound in SEM2. The a ne points of the 18 hyperovals are listed in Table 3 below. Each row represents a hyperoval and an entry j in column i means that the point (i; j) belongs to the corresponding hyperoval. From Table3... ..."

### Table 1: Four-bit binary Graycode

"... In PAGE 3: ... However, some symbols of similar, but not exactly the same value will get mapped in the opposite sense at the region boundaries, and there are more boundaries in the lower signi cance bits. For example, in bit plane 3 (the most signi cant bit plane) of Table1 , there is only one case where twovalues separated by the minimum Euclidean distance get mapped into di erent symbols (going from index 7 to 8) whereas in bit plane 1 there are four instances;; contrast this with the weighted binary case for which, in bit plane 1 there are seven instances. Similarly,two symbols widely separated in Euclidean distance, may be get mapped to the same code in one or more of the bit planes.... ..."

### Table 1: The linear spans of the zero-one sequences from monomial hyperovals.

"... In PAGE 6: ...omputer results when m is small (with the help of R. M. Wilson). The method we used in the calculation is to nd a trace representation for the sequence in question. We list the results in Table1 below. Note that here the sequences are 0,1 sequences which are de ned as follows.... In PAGE 7: ...Table1 lists the sizes of the eld. The next three columns list the linear spans of the 0,1 sequences from the Segre hyperoval, and the two Glynn hyperovals respectively.... In PAGE 7: ...The next three columns list the linear spans of the 0,1 sequences from the Segre hyperoval, and the two Glynn hyperovals respectively. The linear spans in the rst column of Table1 are particularly interesting. The second factors of the linear spans in the rst column satisfy a recursive relation like that of Fibonacci numbers.... ..."

Cited by 1

### Table 1: The linear spans of the zero-one sequences from monomial hyperovals.

"... In PAGE 6: ...omputer results when m is small (with the help of R. M. Wilson). The method we used in the calculation is to find a trace representation for the sequence in question. We list the results in Table1 below. Note that here the sequences are 0,1 sequences which are defined as follows.... In PAGE 7: ...Table1 lists the sizes of the field. The next three columns list the linear spans of the 0,1 sequences from the Segre hyperoval, and the two Glynn hyperovals respectively.... In PAGE 7: ...The next three columns list the linear spans of the 0,1 sequences from the Segre hyperoval, and the two Glynn hyperovals respectively. The linear spans in the first column of Table1 are particularly interesting. The second factors of the linear spans in the first column satisfy a recursive relation like that of Fibonacci numbers.... ..."

Cited by 1

### Table 2: Table of Mixed Partitions of PG(3; 4)

2002

"... In PAGE 4: ... I was, however, able to check using Magma that the planes determined by these partitions are non-isomorphic. It is interesting to note that every translation plane of order 16 can be constructed from one of the mixed partitions in Table2 . Also, the Derived Semifield Plane appears in the table three different times.... ..."

### Table 2. Characteristics for sort algorithms (from [Knuth73, pg. 3811)

1990

Cited by 3