Richard A. Games

According to our database1, Richard A. Games authored at least 21 papers between 1981 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Seeds for Generalized Taxicab Numbers.
J. Integer Seq., 2019

1993
Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols.
IEEE Trans. Inf. Theory, 1993

On Quadratic M-Sequences.
Proceedings of the Fast Software Encryption, 1993

Blind Synchronization of m-Sequnces with Even Span.
Proceedings of the Advances in Cryptology, 1993

1991
Multiple mainbeam sidelobe cancellation architectures for constrained and/or excess degrees of freedom processing.
Proceedings of the 1991 International Conference on Acoustics, 1991

1990
On the quadratic spans of DeBruijn sequences.
IEEE Trans. Inf. Theory, 1990

On the linear span of binary sequences obtained from q-ary m-sequences, q odd.
IEEE Trans. Inf. Theory, 1990

1989
Algebraic-integer quantization and residue number system processing.
Proceedings of the IEEE International Conference on Acoustics, 1989

On the Quadratic Spans of Periodic Sequences.
Proceedings of the Advances in Cryptology, 1989

1986
An algorithm for complex approximations in Z[e<sup>2{pi}i/8</sup>].
IEEE Trans. Inf. Theory, 1986

The geometry of quadrics and correlations of sequences.
IEEE Trans. Inf. Theory, 1986

Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks.
Algorithmica, 1986

On the Linear Span of binary Sequences Obtained from Finite Geometries.
Proceedings of the Advances in Cryptology, 1986

1985
Complex approximations using algebraic integers.
IEEE Trans. Inf. Theory, 1985

Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial.
Discret. Appl. Math., 1985

1983
A fast algorithm for determining the complexity of a binary sequence with period 2<sup>n</sup>.
IEEE Trans. Inf. Theory, 1983

A generalized recursive construction for de Bruijn sequences.
IEEE Trans. Inf. Theory, 1983

There Are No De Bruijn Sequences of Span n with Complexity 2<sup>n-1</sup>+n+1.
J. Comb. Theory, Ser. A, 1983

The Packing Problem for Projective Geometries over GF(3) with Dimension Greater Than Five.
J. Comb. Theory, Ser. A, 1983

1982
On the Complexities of de Bruijn Sequences.
J. Comb. Theory, Ser. A, 1982

1981
(n, k, t)-covering systems and error-trapping decoding.
IEEE Trans. Inf. Theory, 1981


  Loading...