Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John C. Hancock

dblp:133/9257 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 1968
0000-0002-7747-7814ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Information theory · 75% Coding theory · 25%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
clustering
0.011966
Nonsupervised sequential classification and recognition of patterns · IEEE Trans. Inf. Theory 1966
Coding theory
channel coding
0.011966
On receiver structures for channels having memory · IEEE Trans. Inf. Theory 1966
Information theory › communication channels › channel models
channels with memory
0.011966
On receiver structures for channels having memory · IEEE Trans. Inf. Theory 1966
Information theory › statistical inference
detection and estimation
0.011966
Iterative computation of a posteriori probability for M -ary nonsupervised adaptation (Corresp.) · IEEE Trans. Inf. Theory 1966
Information theory
hypothesis testing
0.011965
On learning and distribution-free coincidence detection procedures · IEEE Trans. Inf. Theory 1965
Information theory › communication channels
intersymbol interference
0.021966
Reducing the effects of intersymbol interference with correlation receivers · IEEE Trans. Inf. Theory 1963
On receiver structures for channels having memory · IEEE Trans. Inf. Theory 1966
Information theory › graphical models
a posteriori probability computation
0.011966
Iterative computation of a posteriori probability for M -ary nonsupervised adaptation (Corresp.) · IEEE Trans. Inf. Theory 1966
Physical-layer communications
signal detection
0.011965
On learning and distribution-free coincidence detection procedures · IEEE Trans. Inf. Theory 1965

Methods — techniques the papers use, named apart from their topics

sequential decision procedure · 0.0optimization · 0.0monte carlo simulation · 0.0markov source · 0.0iterative computation · 0.0importance sampling · 0.0conditional probability of error minimization · 0.0bayes approach · 0.0
YearPublicationVenuePosition
1968 An optimum decision-directed scheme for Gaussian mixtures
abstract
The problem of making measurements upon some available signal mixture in order to extract or estimate certain parametric data for subsequent signal detection using the measurement data is considered. The development is carried out for a formal binary signal observation mixture (no a priori classification of the observations into isolated category or class ensembles is assumed), with the parameters of the noise and pulse waveforms unknown. Two categories of multidimensional mixture-resolving estimators are treated: an optimized decision-directed category and a moment method category. In the former, the optimization is formulated to minimize a measure of distance and dispersion with a constraint adjustment to "maximize" a measure of convergence rate. An eigenvalue theory approach is applied to illustrate the relationship of the measurement data to the detector structure. An experimental case study is carried out via digital computer simulation, and a comparison of error probability performance characteristics with the conventional decision-directed and Bayes matched-filter techniques is made. Results of the simulation are presented which indicate quantitatively the superiority of the estimators over conventional decision-directed techniques, in terms of convergence rates and asymptotic performance characteristics.
William D. Gregg, John C. Hancock
IEEE Trans. Inf. Theory2
1966 On receiver structures for channels having memory
abstract
This paper is concerned withm-ary communication channels(m \geq 2)having intersymbol interference betweenLtime periods(L \geq 2). Receiver structures are developed for making jointly optimum (minimum probability of error) decisions aboutLconsecutive symbols on the basis of the complete message received. The decision statistics are computed by a sequential procedure, and the number of computations increases only linearly with the message length. The method can be applied to the general problem of making decisions about the states of a discrete-state Markov information source which is observable only through a channel with additive Gaussian or non-Gaussian noise.
Robert W. Chang, John C. Hancock
IEEE Trans. Inf. Theory2
1966 Iterative computation of a posteriori probability for M -ary nonsupervised adaptation (Corresp.)
John C. Hancock, Edward A. Patrick
IEEE Trans. Inf. Theory1
1966 Nonsupervised sequential classification and recognition of patterns
abstract
A Bayes approach to nonsupervised pattern recognition is given wheren l-dimensional vector samplesX_{1}, X_{2}, \cdots , X_{n}are received unclassified, i.e., any one ofMpattern sources\omega_{1}, \omega_{2}, \cdots, \omega_{M}, with corresponding probabilities of occurrenceQ_{1_{o}}, Q_{2_{o}} , \cdots , Q_{M_{o}}, caused each sampleX_{s}, s=1,2, \cdots , n. The approach utilizes the fact that the cumulative distribution function (c.d.f.) ofX_{s}is a mixture c.d.f.,F(X_{s})= \sum_{i=1}^{M} F(X_{s}|\omega_{i}) Q_{i_{o}}. It is assumed that available a priori knowledge includes knowledge ofMand the family\{F(X_{s}|\omega_{i})\}, whereF(X_{s}|\omega_{i})is characterized by a vectorB_{i_{o}}. In general,B_{i_{o}}andQ_{i_{o}}, i = 1,2, \cdots , Mare considered fixed but unknown, and conditional probability of error in deciding which source causedX_{n}is minimized. When the functional form ofF(X_{s}|\omega_{i})in terms ofB_{i_{o}}is unknown, the family\{F(X_{s}|\omega_{i})\}is taken to be the family of multinomial c.d.f.'s--an application of the histogram concept to the nonsupervisory problem. Additional nonparameteric a priori knowledge about the family--such asF(X_{s}|\omega_{i})is symmetrical, and/orF(X_{s}|\omega_{i})differs fromF(X_{s}|\omega_{j})only by a translational vector--can be utilized in the Bayes solution.
Edward A. Patrick, John C. Hancock
IEEE Trans. Inf. Theory2
1965 On learning and distribution-free coincidence detection procedures
abstract
In this paper, coincidence detection procedures with invariant or distribution-free false alarm rates are proposed and investigated. The only information concerning the channel statistics required by these coincidence procedures is the median of the noise under no-signal conditions. The coincidence procedures are subsequently modified so that the detectors constitute learning systems with respect to time-varying and/or unknown medians. It is shown that their false alarm rates remain distribution free for wide classes of detection problems. The distribution-free coincidence detectors are then applied to various detection problems of practical importance, and their performance evaluated and compared to the performance of comparable likelihood detectors. It is shown that the distribution-free detectors are reasonably efficient, though suboptimal, for channels with Gaussian statistics, and highly efficient for channels with a combination of Gaussian and impulse noise.
John C. Hancock, Demetrios G. Lainiotis
IEEE Trans. Inf. Theory1
1963 Reducing the effects of intersymbol interference with correlation receivers
abstract
This paper considers the problem of intersymbol interference in a binary communication system and the optimization of a class of linear receivers to minimize the effects of this interference. The class of correlation receivers is chosen for investigation, and maximizing the probability of correct reception is used as the performance criterion. The optimum decision level as well as optimum impulse response is determined for receivers with and without memory where a priori knowledge of the channel characteristics are available. The performances of these receivers are evaluated and compared with nonoptimum linear receivers.
Joseph M. Aein, John C. Hancock
IEEE Trans. Inf. Theory2
1960 A relation between zero-crossings and Fourier coefficients for bandwidth-limited functions (Corresp.)
Frederick E. Bond, Charles R. Cahn, John C. Hancock
IRE Trans. Inf. Theory3