default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDT. T. Kadota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1994
[j28]T. T. Kadota:
Integration of complementary detection-localization systems - An example. IEEE Trans. Inf. Theory 40(3): 808-819 (1994)- 1992
- [j27]Edgar N. Gilbert, T. T. Kadota:
The Lempel-Ziv algorithm and message complexity. IEEE Trans. Inf. Theory 38(6): 1839-1842 (1992) - 1991
- [j26]T. T. Kadota:
An optimum strategy for detection in the presence of random transient disturbance and white Gaussian noise. IEEE Trans. Inf. Theory 37(2): 276-284 (1991) - 1990
- [j25]T. T. Kadota:
A nonlinear optimum-detection problem - I: Theory. IEEE Trans. Inf. Theory 36(2): 347-357 (1990) - [j24]T. T. Kadota:
A nonlinear optimum-detection problem-II: Simple numerical examples. IEEE Trans. Inf. Theory 36(2): 434-439 (1990) - 1988
- [j23]T. T. Kadota:
Approximately optimum detection of deterministic signals in Gaussian and compound Poisson noise. IEEE Trans. Inf. Theory 34(6): 1517-1527 (1988) - 1985
- [j22]Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp:
A Stochastic Model of Fragmentation in Dynamic Storage Allocation. SIAM J. Comput. 14(2): 416-425 (1985) - [j21]Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp:
On the Asymptotic Optimality of First-Fit Storage Allocation. IEEE Trans. Software Eng. 11(2): 235-239 (1985) - 1983
- [j20]T. T. Kadota:
Piecewise linear random paths on a plane and a central limit theorem. IEEE Trans. Inf. Theory 29(2): 241-244 (1983) - [j19]T. T. Kadota, Judith B. Seery:
Probability distributions of randomly moving objects on a plane. IEEE Trans. Inf. Theory 29(5): 756-761 (1983) - 1981
- [j18]T. T. Kadota, Frank M. Labianca:
A fourth-order homogeneous random field in oceanography. IEEE Trans. Inf. Theory 27(5): 656-658 (1981) - 1980
- [j17]Alfons J. Claus, T. T. Kadota, Dennis M. Romain:
Efficient approximation of a family of noises for application in adaptive spatial processing for signal detection. IEEE Trans. Inf. Theory 26(5): 588-595 (1980) - 1978
- [j16]T. T. Kadota:
Optimal, causal, simultaneous detection and estimation of random signal fields in a Gaussian noise field. IEEE Trans. Inf. Theory 24(3): 297-308 (1978) - 1977
- [j15]T. T. Kadota, Dennis M. Romain:
Optimum detection of Gaussian signal fields in the multipath-anisotropic noise environment and numerical evaluation of detection probabilities. IEEE Trans. Inf. Theory 23(2): 167-178 (1977) - 1973
- [j14]T. T. Kadota:
On the capacity of asymptotically memoryless continuous-time channels (Corresp.). IEEE Trans. Inf. Theory 19(4): 556-557 (1973) - 1972
- [j13]T. T. Kadota:
Coding theorem and its converse for continuous incrementally stationary channels with finite incremental memory (Corresp.). IEEE Trans. Inf. Theory 18(4): 510-513 (1972) - 1971
- [j12]T. T. Kadota:
On the mutual information of memoryless channels. IEEE Trans. Inf. Theory 17(2): 140-143 (1971) - [j11]T. T. Kadota, Moshe Zakai, Jacob Ziv:
Mutual information of the white Gaussian channel with and without feedback. IEEE Trans. Inf. Theory 17(4): 368-371 (1971) - [j10]T. T. Kadota, Moshe Zakai, Jacob Ziv:
Capacity of a continuous memoryless channel with feedback. IEEE Trans. Inf. Theory 17(4): 372-378 (1971) - [j9]T. T. Kadota, Aaron D. Wyner, Jacob Ziv:
Bound on the average transmission time for sequential estimation systems containing an additive Gaussian noise channel. IEEE Trans. Inf. Theory 17(5): 514-515 (1971) - 1970
- [j8]B. H. Bharucha, T. T. Kadota:
On the representation of continuous parameter processes by a sequence of random variables. IEEE Trans. Inf. Theory 16(2): 139-141 (1970) - [j7]T. T. Kadota:
Nonsingular detection and likelihood ratio for random signals in white Gaussian noise. IEEE Trans. Inf. Theory 16(3): 291-298 (1970) - [j6]T. T. Kadota:
Generalization of Feinstein's fundamental lemma (Corresp.). IEEE Trans. Inf. Theory 16(6): 791-792 (1970) - 1969
- [j5]T. T. Kadota:
Optimum estimation of nonstationary Gaussian signals in noise. IEEE Trans. Inf. Theory 15(2): 253-257 (1969) - 1968
- [j4]T. T. Kadota:
Examples of optimum detection of Gaussian signals and interpretation of white noise. IEEE Trans. Inf. Theory 14(5): 725-734 (1968) - 1967
- [j3]T. T. Kadota:
Differentiation of Karhunen-Loève expansion and application to optimum reception of sure signals in noise. IEEE Trans. Inf. Theory 13(2): 255-260 (1967) - [j2]T. T. Kadota, Larry A. Shepp:
On the best finite set of linear observables for discriminating two Gaussian signals. IEEE Trans. Inf. Theory 13(2): 278-284 (1967) - 1966
- [j1]T. T. Kadota:
Generalized maximum likelihood test and minimum error probability (Corresp.). IEEE Trans. Inf. Theory 12(1): 65-67 (1966)
Conference and Workshop Papers
- 1989
- [c1]T. T. Kadota:
A nonlinear optimum-detection problem. ICASSP 1989: 2673-2675
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:04 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:
