default search action
Eric M. Rains
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j22]Fokko J. van de Bult, Eric M. Rains:
Limits of elliptic hypergeometric biorthogonal functions. J. Approx. Theory 193: 128-163 (2015) - 2012
- [j21]Eric M. Rains:
Elliptic Littlewood identities. J. Comb. Theory A 119(7): 1558-1609 (2012)
2000 – 2009
- 2009
- [p1]Jeffrey C. Lagarias, Eric M. Rains, Robert J. Vanderbei:
The Kruskal Count. The Mathematics of Preference, Choice and Order 2009: 371-391 - 2006
- [j20]Nadia Heninger, Eric M. Rains, Neil J. A. Sloane:
On the integrality of nth roots of generating functions. J. Comb. Theory A 113(8): 1732-1745 (2006) - [j19]Thomas G. Draper, Samuel A. Kutin, Eric M. Rains, Krysta M. Svore:
A logarithmic-depth quantum carry-lookahead adder. Quantum Inf. Comput. 6(4): 351-369 (2006) - 2004
- [j18]Gabriele Nebe, Heinz Georg Quebbemann, Eric M. Rains, Neil J. A. Sloane:
Complete weight enumerators of generalized doubly-even self-dual codes. Finite Fields Their Appl. 10(4): 540-550 (2004) - [j17]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane, Nasha Komanda:
The EKG Sequence: 10927. Am. Math. Mon. 111(2): 167-168 (2004) - 2003
- [j16]Eric M. Rains:
New asymptotic bounds for self-dual codes and lattices. IEEE Trans. Inf. Theory 49(5): 1261-1274 (2003) - 2002
- [j15]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane:
The EKG Sequence. Exp. Math. 11(3): 437-446 (2002) - [j14]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane:
Problem 10927. Am. Math. Mon. 109(2): 202 (2002) - 2001
- [j13]Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane:
The Invariants of the Clifford Groups. Des. Codes Cryptogr. 24(1): 99-122 (2001) - [j12]Eric M. Rains:
A semidefinite program for distillable entanglement. IEEE Trans. Inf. Theory 47(7): 2921-2933 (2001) - 2000
- [j11]Eric M. Rains:
Polynomial invariants of quantum codes. IEEE Trans. Inf. Theory 46(1): 54-59 (2000)
1990 – 1999
- 1999
- [j10]Eric M. Rains:
Optimal self-dual codes over Z4. Discret. Math. 203(1-3): 215-228 (1999) - [j9]Eric M. Rains:
Quantum Codes of Minimum Distance Two. IEEE Trans. Inf. Theory 45(1): 266-271 (1999) - [j8]Eric M. Rains:
Nonbinary quantum codes. IEEE Trans. Inf. Theory 45(6): 1827-1832 (1999) - [j7]Eric M. Rains:
Quantum shadow enumerators. IEEE Trans. Inf. Theory 45(7): 2361-2366 (1999) - [j6]Eric M. Rains:
Monotonicity of the quantum linear programming bound. IEEE Trans. Inf. Theory 45(7): 2489-2492 (1999) - 1998
- [j5]Yves Edel, Eric M. Rains, Neil J. A. Sloane:
On Kissing Numbers in Dimensions 32 to 128. Electron. J. Comb. 5 (1998) - [j4]Eric M. Rains:
Increasing Subsequences and the Classical Groups. Electron. J. Comb. 5 (1998) - [j3]Eric M. Rains:
Shadow Bounds for Self-Dual Codes. IEEE Trans. Inf. Theory 44(1): 134-139 (1998) - [j2]A. Robert Calderbank, Eric M. Rains, Peter W. Shor, Neil J. A. Sloane:
Quantum Error Correction Via Codes Over GF(4). IEEE Trans. Inf. Theory 44(4): 1369-1387 (1998) - [j1]Eric M. Rains:
Quantum Weight Enumerators. IEEE Trans. Inf. Theory 44(4): 1388-1394 (1998)
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:21 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: