default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLawrence H. Ozarow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j16]Krishna Balachandran, Doru Calin, Nandu Gopalakrishnan, Joseph H. Kang, Achilles G. Kogiantis, Shupeng Li, Lawrence H. Ozarow, Sudhir Ramakrishna, Ashok N. Rudrapatna, Russell Sun:
Design and performance analysis of collaborative spatial multiplexing for IEEE 802.16e-based systems. Bell Labs Tech. J. 13(4): 97-117 (2009)- 2005
- [j15]Naresh Sharma, Lawrence H. Ozarow:
A study of opportunism for multiple-antenna systems. IEEE Trans. Inf. Theory 51(5): 1804-1814 (2005) - 2004
- [j14]Naresh Sharma, Lawrence H. Ozarow, Achilles G. Kogiantis:
MIMO channel statistics in the presence of non-uniform angle spread. IEEE Commun. Lett. 8(7): 428-430 (2004) - 2003
- [c2]Achilles G. Kogiantis, Lawrence H. Ozarow:
Downlink best-effort packet data with multiple antennas. ICC 2003: 715-719
1990 – 1999
- 1992
- [j13]Chris Heegard, Lawrence H. Ozarow:
Bounding the Capacity of Saturation Recording: The Lorentz Model and Applications. IEEE J. Sel. Areas Commun. 10(1): 145-156 (1992) - 1991
- [j12]Shlomo Shamai, Lawrence H. Ozarow, Aaron D. Wyner:
Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs. IEEE Trans. Inf. Theory 37(6): 1527-1539 (1991) - 1990
- [j11]Lawrence H. Ozarow:
Random coding for additive Gaussian channels with feedback. IEEE Trans. Inf. Theory 36(1): 17-22 (1990) - [j10]Lawrence H. Ozarow:
Upper bounds on the capacity of Gaussian channels with feedback. IEEE Trans. Inf. Theory 36(1): 156-161 (1990) - [j9]Lawrence H. Ozarow, Lawrence A. Shepp:
The exact information complexity of Indian poker. IEEE Trans. Inf. Theory 36(1): 232-234 (1990) - [j8]A. Robert Calderbank, Lawrence H. Ozarow:
Nonequiprobable signaling on the Gaussian channel. IEEE Trans. Inf. Theory 36(4): 726-740 (1990) - [j7]Lawrence H. Ozarow, Aaron D. Wyner:
On the capacity of the Gaussian channel with a finite number of input levels. IEEE Trans. Inf. Theory 36(6): 1426-1428 (1990)
1980 – 1989
- 1988
- [j6]Lawrence H. Ozarow, Aaron D. Wyner, Jacob Ziv:
Achievable rates for a constrained Gaussian channel. IEEE Trans. Inf. Theory 34(3): 365-370 (1988) - 1984
- [j5]Lawrence H. Ozarow, Aaron D. Wyner:
Wire-tap channel II. AT&T Bell Lab. Tech. J. 63(10): 2135-2157 (1984) - [j4]Lawrence H. Ozarow:
The capacity of the white Gaussian multiple access channel with feedback. IEEE Trans. Inf. Theory 30(4): 623-628 (1984) - [j3]Lawrence H. Ozarow, Sik K. Leung-Yan-Cheong:
An achievable region and outer bound for the Gaussian broadcast channel with feedback. IEEE Trans. Inf. Theory 30(4): 667-671 (1984) - [c1]Lawrence H. Ozarow, Aaron D. Wyner:
Wire-Tap Channel II. EUROCRYPT 1984: 33-50
1970 – 1979
- 1979
- [b1]Lawrence H. Ozarow:
Coding and capacity for additive white Gaussian noise multi-user channels with feedback. Massachusetts Institute of Technology, Cambridge, MA, USA, 1979 - [j2]David Chase, Lawrence H. Ozarow:
Capacity Limits for Binary Codes in the Presence of Interference. IEEE Trans. Commun. 27(2): 441-448 (1979) - [j1]Joseph K. DeRosa, Lawrence H. Ozarow, Leslie N. Weiner:
Efficient Packet Satellite Communications. IEEE Trans. Commun. 27(10): 1416-1422 (1979)
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-24 23:06 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:
