| 1993 |
|---|
| 17 | EE | Richard A. Games,
Joseph J. Rushanan:
Blind Synchronization of m-Sequnces with Even Span.
EUROCRYPT 1993: 168-180 |
| 16 | | Agnes Hui Chan,
Richard A. Games,
Joseph J. Rushanan:
On Quadratic M-Sequences.
FSE 1993: 166-173 |
| 15 | | Oscar Moreno,
Richard A. Games,
Herbert Taylor:
Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols.
IEEE Transactions on Information Theory 39(6): 1985- (1993) |
| 1990 |
|---|
| 14 | | Agnes Hui Chan,
Richard A. Games:
On the linear span of binary sequences obtained from q-ary m-sequences, q odd.
IEEE Transactions on Information Theory 36(3): 548-552 (1990) |
| 13 | | Agnes Hui Chan,
Richard A. Games:
On the quadratic spans of DeBruijn sequences.
IEEE Transactions on Information Theory 36(4): 822-829 (1990) |
| 1989 |
|---|
| 12 | EE | Agnes Hui Chan,
Richard A. Games:
On the Quadratic Spans of Periodic Sequences.
CRYPTO 1989: 82-89 |
| 1986 |
|---|
| 11 | EE | Agnes Hui Chan,
Richard A. Games:
On the Linear Span of binary Sequences Obtained from Finite Geometries.
CRYPTO 1986: 405-417 |
| 10 | | Richard A. Games:
Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks.
Algorithmica 1(2): 233-250 (1986) |
| 9 | | Richard A. Games:
The geometry of quadrics and correlations of sequences.
IEEE Transactions on Information Theory 32(3): 423- (1986) |
| 8 | | Richard A. Games:
An algorithm for complex approximations in Z[e2{pi}i/8].
IEEE Transactions on Information Theory 32(4): 603- (1986) |
| 1985 |
|---|
| 7 | | Richard A. Games:
Complex approximations using algebraic integers.
IEEE Transactions on Information Theory 31(5): 565-579 (1985) |
| 1983 |
|---|
| 6 | | Richard A. Games,
Agnes Hui Chan:
A fast algorithm for determining the complexity of a binary sequence with period 2n.
IEEE Transactions on Information Theory 29(1): 144- (1983) |
| 5 | | Richard A. Games:
A generalized recursive construction for de Bruijn sequences.
IEEE Transactions on Information Theory 29(6): 843-849 (1983) |
| 4 | | Richard A. Games:
There Are No De Bruijn Sequences of Span n with Complexity 2n-1+n+1.
J. Comb. Theory, Ser. A 34(2): 248-251 (1983) |
| 3 | | Richard A. Games:
The Packing Problem for Projective Geometries over GF(3) with Dimension Greater Than Five.
J. Comb. Theory, Ser. A 35(2): 126-144 (1983) |
| 1982 |
|---|
| 2 | | Agnes Hui Chan,
Richard A. Games,
Edwin L. Key:
On the Complexities of de Bruijn Sequences.
J. Comb. Theory, Ser. A 33(3): 233-246 (1982) |
| 1981 |
|---|
| 1 | | Agnes Hui Chan,
Richard A. Games:
(n, k, t)-covering systems and error-trapping decoding.
IEEE Transactions on Information Theory 27(5): 643- (1981) |
