default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommy Guess
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j10]Satya Prakash Ponnaluri, Tommy Guess:
Effects of Spreading and Training on Capacity in Overloaded CDMA. IEEE Trans. Commun. 56(4): 523-526 (2008)- 2007
- [j9]Satya Prakash Ponnaluri, Tommy Guess:
Signature sequence and training design for overloaded CDMA systems. IEEE Trans. Wirel. Commun. 6(4): 1337-1345 (2007) - 2005
- [j8]Tommy Guess, Mahesh K. Varanasi:
An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels. IEEE Trans. Inf. Theory 51(1): 173-187 (2005) - 2004
- [j7]Tommy Guess:
User-capacity maximization in synchronous CDMA subject to RMS-bandlimited signature waveforms. IEEE Trans. Commun. 52(3): 457-466 (2004) - [j6]Tommy Guess:
CDMA with power control and sequence design: the capacity region with and without multidimensional signaling. IEEE Trans. Inf. Theory 50(11): 2604-2619 (2004) - [c6]Satya Prakash Ponnaluri, Tommy Guess:
Effect of spreading and training on sum-capacity in overloaded synchronous CDMA. GLOBECOM 2004: 262-266 - [c5]Timour V. Kotchiev, Tommy Guess:
Minimum time-RMS bandwidth product for synchronous CDMA with multiple classes of users. ICC 2004: 370-374 - 2003
- [j5]Tommy Guess:
Optimal sequences for CDMA with decision-feedback receivers. IEEE Trans. Inf. Theory 49(4): 886-900 (2003) - [j4]Tommy Guess, Mahesh K. Varanasi:
A comparison of bandwidth-efficient multiple access to other signal designs for correlated waveform multiple-access communications. IEEE Trans. Inf. Theory 49(6): 1558-1564 (2003) - [c4]Hao Zhang, Tommy Guess:
Asymptotical analysis of the outage capacity of rate-tailored BLAST. GLOBECOM 2003: 1797-1801 - [c3]Tommy Guess, Hao Zhang, Timour V. Kotchiev:
The outage capacity of BLAST for MIMO channels. ICC 2003: 2628-2632 - 2002
- [c2]Tommy Guess, Robert F. Riemenschneider:
The design of multiuser detectors for guaranteed bit error rate in CDMA. GLOBECOM 2002: 1068-1072 - 2001
- [j3]Mahesh K. Varanasi, Tommy Guess:
Bandwidth-efficient multiple access (BEMA): a new strategy based on signal design under quality-of-service constraints for successive-decoding-type multiuser receivers. IEEE Trans. Commun. 49(5): 844-854 (2001) - 2000
- [j2]Tommy Guess, Mahesh K. Varanasi:
Error exponents for maximum-likelihood and successive decoders for the Gaussian CDMA channel. IEEE Trans. Inf. Theory 46(4): 1683-1691 (2000) - [j1]Tommy Guess, Mahesh K. Varanasi:
Signal design for bandwidth-efficient multiple-access communications based on Eigenvalue optimization. IEEE Trans. Inf. Theory 46(6): 2045-2058 (2000)
1990 – 1999
- 1997
- [c1]Stephen G. Kaufman, Barry L. Spletzer, Tommy Guess:
Freeform fabrication of polymer-matrix composite structures. ICRA 1997: 317-322
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-04-25 05:57 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:
