default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLee D. Davisson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1994
[j42]Kwang-Cheng Chen
, Lee D. Davisson:
On the loop noise bandwidth of SCCL. IEEE Trans. Commun. 42(11): 2938-2941 (1994)- [j41]Kwang-Cheng Chen, Lee D. Davisson:
Analysis of SCCL as a PN-code tracking loop. IEEE Trans. Commun. 42(11): 2942-2946 (1994) - 1992
- [j40]Kwang-Cheng Chen, Lee D. Davisson:
Analysis of a new bit tracking loop-SCCL. IEEE Trans. Commun. 40(1): 199-209 (1992) - 1990
- [j39]Chein-I Chang, Simon C. Fan, Lee D. Davisson:
On Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless Channels. Inf. Comput. 86(1): 1-13 (1990) - [j38]Chein-I Chang, Lee D. Davisson:
Two iterative algorithms for finding minimax solutions. IEEE Trans. Inf. Theory 36(1): 126-140 (1990)
1980 – 1989
- 1989
- [c1]Chein-I Chang, Lee D. Davisson:
A counterpart of Remez's algorithms in statistical decision theory: Chang-Davisson's algorithms. ICASSP 1989: 1345-1348 - 1988
- [j37]Lee D. Davisson, Paul G. Flikkema:
Fast single-element PN acquisition for the TDRSS MA system. IEEE Trans. Commun. 36(11): 1226-1235 (1988) - [j36]Paul G. Flikkema, Lee D. Davisson:
Detection of baseband signals using a delta modulator. IEEE Trans. Inf. Theory 34(3): 537-543 (1988) - [j35]Chein-I Chang, Lee D. Davisson:
On calculating the capacity of an infinite-input finite (infinite)-output channel. IEEE Trans. Inf. Theory 34(5): 1004-1010 (1988) - 1983
- [j34]Lee D. Davisson:
Minimax noiseless universal coding for Markov sources. IEEE Trans. Inf. Theory 29(2): 211-214 (1983) - 1981
- [j33]Lee D. Davisson, Robert J. McEliece, Michael B. Pursley, Mark Wallace:
Efficient universal noiseless source codes. IEEE Trans. Inf. Theory 27(3): 269-279 (1981) - [j32]Lee D. Davisson, Giuseppe Longo, Andrea Sgarro:
The error exponent for the noiseless encoding of finite ergodic Markov sources. IEEE Trans. Inf. Theory 27(4): 431-437 (1981) - [j31]Lee D. Davisson:
Review of 'Principles of Digital Communications and Coding' (A. J. Viterbi and J. K. Omura, 1979). IEEE Trans. Inf. Theory 27(5): 670- (1981) - 1980
- [j30]Dimitri Kazakos, Lee D. Davisson:
An improved decision-directed detector (Corresp.). IEEE Trans. Inf. Theory 26(1): 113-116 (1980) - [j29]Lee D. Davisson, Alberto Leon-Garcia:
A source matching approach to finding minimax codes. IEEE Trans. Inf. Theory 26(2): 166-174 (1980)
1970 – 1979
- 1979
- [j28]Alberto Leon-Garcia, Lee D. Davisson, David L. Neuhoff:
New results on coding of stationary nonergodic sources. IEEE Trans. Inf. Theory 25(2): 137-144 (1979) - 1976
- [j27]Michael B. Pursley, Lee D. Davisson:
Variable rate coding for nonergodic sources and classes of ergodic sources subject to a fidelity constraint. IEEE Trans. Inf. Theory 22(3): 324-337 (1976) - 1975
- [j26]Robert M. Gray, Lee D. Davisson:
Quantizer Mismatch. IEEE Trans. Commun. 23(4): 439-443 (1975) - [j25]Jae-Kyoon Kim, Lee D. Davisson:
Adaptive linear estimation for stationary M-dependent processes. IEEE Trans. Inf. Theory 21(1): 23-31 (1975) - [j24]Lee D. Davisson, Michael B. Pursley:
A direct proof of the coding theorem for discrete sources with memory. IEEE Trans. Inf. Theory 21(3): 310-317 (1975) - [j23]Lee D. Davisson, P. Papantoni-Kazakos:
On the response of an RC filter-hard limiter- RC filter detector to nonzero-mean white Gaussian noise (Corresp.). IEEE Trans. Inf. Theory 21(3): 338-341 (1975) - [j22]David L. Neuhoff, Robert M. Gray, Lee D. Davisson:
Fixed rate universal block source coding with a fidelity criterion. IEEE Trans. Inf. Theory 21(5): 511-523 (1975) - 1974
- [j21]Robert M. Gray, Lee D. Davisson:
Source coding theorems without the ergodic assumption. IEEE Trans. Inf. Theory 20(4): 502-516 (1974) - [j20]Robert M. Gray, Lee D. Davisson:
The ergodic decomposition of stationary discrete random processes. IEEE Trans. Inf. Theory 20(5): 625-636 (1974) - [j19]Lee D. Davisson:
Review of 'Foundations of the Theory of Learning Systems' (Tsypkin, Ya. Z.; 1973). IEEE Trans. Inf. Theory 20(5): 693 (1974) - 1973
- [j18]Lee D. Davisson, P. Papantoni-Kazakos:
On the distribution and moments of RC -filtered hard-limited RC -filtered white noise. IEEE Trans. Inf. Theory 19(4): 411-414 (1973) - [j17]Lee D. Davisson:
Universal noiseless coding. IEEE Trans. Inf. Theory 19(6): 783-795 (1973) - 1972
- [j16]Lee D. Davisson, Laurence B. Milstein:
On the Performance of Digital Communication Systems with Bandpass Limiters-Part I: One-Link System. IEEE Trans. Commun. 20(5): 972-975 (1972) - [j15]Lee D. Davisson, Laurence B. Milstein:
On the Performance of Digital Communication Systems With Bandpass Limiters-Part II: Two-Link System. IEEE Trans. Commun. 20(5): 975-980 (1972) - [j14]Lee D. Davisson:
Rate Distortion Theory: A Mathematical Basis for Data Compression. IEEE Trans. Commun. 20(6): 1202 (1972) - [j13]Lee D. Davisson:
Comments on 'An Algorithm for Source Coding'. IEEE Trans. Inf. Theory 18(6): 827 (1972) - 1971
- [j12]Lee D. Davisson:
Two theorems on minimax equalization (Corresp.). IEEE Trans. Inf. Theory 17(3): 353-355 (1971) - 1970
- [j11]Lee D. Davisson, Edward A. Feustel, James W. Modestino:
The effects of dependence on nonparametric detection. IEEE Trans. Inf. Theory 16(1): 32-41 (1970) - [j10]Lee D. Davisson, Stuart C. Schwartz:
Analysis of a decision-directed receiver with unknown priors. IEEE Trans. Inf. Theory 16(3): 270-276 (1970) - [j9]Lee D. Davisson:
Steady-state error in adaptive mean-square minimization. IEEE Trans. Inf. Theory 16(4): 382-385 (1970) - [j8]Lee D. Davisson:
Convergence probability bounds for stochastic approximation. IEEE Trans. Inf. Theory 16(6): 680-685 (1970)
1960 – 1969
- 1968
- [j7]Lee D. Davisson:
Data compression using straight line interpolation. IEEE Trans. Inf. Theory 14(3): 390-394 (1968) - [j6]Edward A. Feustel, Lee D. Davisson:
On the Efficacy of Mixed Locally-Most-Powerful One- and Two-Sample Rank Tests (Corresp.). IEEE Trans. Inf. Theory 14(5): 776-778 (1968) - 1967
- [j5]Edward A. Feustel, Lee D. Davisson:
The asymptotic relative efficiency of mixed statistical tests. IEEE Trans. Inf. Theory 13(2): 247-255 (1967) - [j4]Lee D. Davisson:
An approximate theory of prediction for data compression. IEEE Trans. Inf. Theory 13(2): 274-278 (1967) - 1966
- [j3]Lee D. Davisson:
A theory of adaptive filtering. IEEE Trans. Inf. Theory 12(2): 97-102 (1966) - 1965
- [j2]Lee D. Davisson:
The prediction error of stationary Gaussian time series of unknown covariance. IEEE Trans. Inf. Theory 11(4): 527-532 (1965) - [j1]Lee D. Davisson:
Sufficient conditions for the regularity and nonregularity of random processes (Corresp.). IEEE Trans. Inf. Theory 11(4): 591 (1965)
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:17 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:
