default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard A. Games
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j15]Jeffrey H. Dinitz, Richard A. Games, Robert L. Roth:
Seeds for Generalized Taxicab Numbers. J. Integer Seq. 22(3): 19.3.3 (2019)- 1993
- [j14]Oscar Moreno, Richard A. Games, Herbert Taylor:
Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols. IEEE Trans. Inf. Theory 39(6): 1985-1987 (1993) - 1990
- [j13]Agnes Hui Chan, Richard A. Games:
On the linear span of binary sequences obtained from q-ary m-sequences, q odd. IEEE Trans. Inf. Theory 36(3): 548-552 (1990) - [j12]Agnes Hui Chan, Richard A. Games:
On the quadratic spans of DeBruijn sequences. IEEE Trans. Inf. Theory 36(4): 822-829 (1990) - 1986
- [j11]Richard A. Games:
Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks. Algorithmica 1(2): 233-250 (1986) - [j10]Richard A. Games:
The geometry of quadrics and correlations of sequences. IEEE Trans. Inf. Theory 32(3): 423-426 (1986) - [j9]Richard A. Games:
An algorithm for complex approximations in Z[e2{pi}i/8]. IEEE Trans. Inf. Theory 32(4): 603-607 (1986) - 1985
- [j8]Richard A. Games:
Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial. Discret. Appl. Math. 12(2): 139-146 (1985) - [j7]Richard A. Games:
Complex approximations using algebraic integers. IEEE Trans. Inf. Theory 31(5): 565-579 (1985) - 1983
- [j6]Richard A. Games:
There Are No De Bruijn Sequences of Span n with Complexity 2n-1+n+1. J. Comb. Theory A 34(2): 248-251 (1983) - [j5]Richard A. Games:
The Packing Problem for Projective Geometries over GF(3) with Dimension Greater Than Five. J. Comb. Theory A 35(2): 126-144 (1983) - [j4]Richard A. Games, Agnes Hui Chan:
A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans. Inf. Theory 29(1): 144-146 (1983) - [j3]Richard A. Games:
A generalized recursive construction for de Bruijn sequences. IEEE Trans. Inf. Theory 29(6): 843-849 (1983) - 1982
- [j2]Agnes Hui Chan, Richard A. Games, Edwin L. Key:
On the Complexities of de Bruijn Sequences. J. Comb. Theory A 33(3): 233-246 (1982) - 1981
- [j1]Agnes Hui Chan, Richard A. Games:
(n, k, t)-covering systems and error-trapping decoding. IEEE Trans. Inf. Theory 27(5): 643-646 (1981)
Conference and Workshop Papers
- 1993
- [c6]Richard A. Games, Joseph J. Rushanan:
Blind Synchronization of m-Sequnces with Even Span. EUROCRYPT 1993: 168-180 - [c5]Agnes Hui Chan, Richard A. Games, Joseph J. Rushanan:
On Quadratic M-Sequences. FSE 1993: 166-173 - 1991
- [c4]Willard L. Eastman, Richard A. Games, Michael J. Sousa:
Multiple mainbeam sidelobe cancellation architectures for constrained and/or excess degrees of freedom processing. ICASSP 1991: 1589-1592 - 1989
- [c3]Agnes Hui Chan, Richard A. Games:
On the Quadratic Spans of Periodic Sequences. CRYPTO 1989: 82-89 - [c2]Richard A. Games, Daniel Moulin, Sean D. O'Neil, Joseph J. Rushanan:
Algebraic-integer quantization and residue number system processing. ICASSP 1989: 948-951 - 1986
- [c1]Agnes Hui Chan, Richard A. Games:
On the Linear Span of binary Sequences Obtained from Finite Geometries. CRYPTO 1986: 405-417
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
