### TABLE II asymptotic multivariate merit factor for various quadratic constructions

2005

Cited by 4

### TABLE III Computational results for asymptotic merit factor for various quadratic constructions

2005

Cited by 4

### Table 1. Results of binary sequence interpretations with the merit factor values of ternary sequences unaltered.

### Table 3. Downscaling merit.

"... In PAGE 3: ....1. Past trends It might be useful to study the downscaling trend of the past cases. Table3 shows how the electrical characteristics of LSIs change by the scaling with parameter shrink factor K, and chip increase factor ??for the ideal case in which all the scaling parameters such as gate length, width and supply voltage scale down by the same factor KFigs.4 (a) and (b), and Table 4 show the past trends of device parameters, chip area, and LSI characteristics.... ..."

### TABLE I Highest Merit Factors for skew-symmetric sequences as obtained by various authors [17], [18], [19], [8], [6] and by our method.

### Table 3. Some of the bi-alphabetic sequences with improved merit factors.

### 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 1 The distributions of lengths of longest runs in binary sequences of length 1,000,000 with the number of bits considered varying from 1 to 6.

"... In PAGE 11: ... The number of classes, Nc, representing the distribution of possible longest runs depends upon the number of bits con- sidered. Table1 illustrates the observed distributions of probabilities, p, for a longest run of a random binary sequence when t = 2, l, the length of the sequence = 1,000,000 and 1 s 6 bit locations are examined. It can be seen that Nc becomes smaller as the number of bits to be tested increases.... ..."

### (Table 2). The constructs were then cloned into an Agrobacterium binary vector with

2001

"... In PAGE 40: ...as used to read absorbance of each well at 492nm. Details are in Appendix E. PCR-UDG Cloning of Aptamers A PCR-UDG cloning strategy was designed to clone the aptamer, YPASYMQ and HPYTFLN, respectively, as the leading sequence and in-frame fusion with GUS reporter gene in a plant expression vector generated from pBI221 (Figure 10). Each amino acid codon was modified based on the citrus codon preference (Table2 ). Full length pthA gene was cloned into the Bam HI site of plant expression vector pBI221 to create a tranlational fusion with GUS reporter gene on the vector by Dr.... ..."

### Table 1: Asymptotic complexity for matrix construction

"... In PAGE 1: ... Yet, other polynomial multiplication methods, such as Karatsuba apos;s, may o er simpler though asymptotically slower alternatives;; the latter maybeadvantageous in cer- tain circumstances, as discussed in section 8. Table1 com- pares the existing and the achieved complexities, in terms of matrix row and column dimension, respectively denoted a and c and the number of variables n, as explained in sec- tion 6. Note that a gt;cand typically a;; c n.... ..."