The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |