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

Henry D. Chadwick

dblp:64/6149 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1972
—ORCID · none

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

Theory of computation · 4 · 4 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
3 papers
Coding theory · 73% Information theory · 27%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › combinatorial coding theory
permutation codes
0.021970
The equivalence of rank permutation codes to a new class of binary codes (Corresp.) · IEEE Trans. Inf. Theory 1970
Rank permutation group codes based on Kendall's correlation statistic · IEEE Trans. Inf. Theory 1969
Physical-layer communications › modulation
phase modulation
0.011972
Binary single-sideband phase-modulated communication systems (Corresp.) · IEEE Trans. Inf. Theory 1972
Physical-layer communications › modulation › amplitude modulation
single-sideband modulation
0.011972
Binary single-sideband phase-modulated communication systems (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › q-ary codes
binary codes
0.011970
The equivalence of rank permutation codes to a new class of binary codes (Corresp.) · IEEE Trans. Inf. Theory 1970
Coding theory › error-correcting codes › nonlinear codes
nonlinear binary codes
0.011970
The equivalence of rank permutation codes to a new class of binary codes (Corresp.) · IEEE Trans. Inf. Theory 1970
Information theory › hypothesis testing › signal detection
nonparametric detection
0.011968
Two Sequential Nonparametric Detection Procedures · Inf. Control. 1968
Information theory › statistical inference › sequential analysis
sequential detection
0.011968
Two Sequential Nonparametric Detection Procedures · Inf. Control. 1968
Physical-layer communications › modulation › m-ary signaling
binary signaling
0.011972
Binary single-sideband phase-modulated communication systems (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › block codes › linear code › code parameters
code distance
0.011969
Rank permutation group codes based on Kendall's correlation statistic · IEEE Trans. Inf. Theory 1969

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

suppressed-carrier modulation · 0.0hilbert transform · 0.0sequential probability ratio test · 0.0rank correlation decoding · 0.0group theory · 0.0computer simulation · 0.0
YearPublicationVenuePosition
1972 Binary single-sideband phase-modulated communication systems (Corresp.)
abstract
Single-sideband phase modulation (SSBPM), in which a signal is simultaneously phase- and amplitude-modulated by a signal and its Hilbert transform, is shown to be suboptimum for binary signaling in white Gaussian noise. An alternative single-sideband technique based on the properties of binary suppressed-carrier phase modulation is proposed and shown to give performance equivalent to the double-sideband version.
Henry D. Chadwick
IEEE Trans. Inf. Theory1
1970 The equivalence of rank permutation codes to a new class of binary codes (Corresp.)
abstract
An equivalence between the rank permutation codes and a new class of binary codes has been observed. A binary code may be generated by direct transformation of a permutation code. The binary codes are usually nonlinear and may be decoded by the inverse transformation and rank correlation of the equivalent permutation.
Henry D. Chadwick, Irving S. Reed
IEEE Trans. Inf. Theory1
1969 Rank permutation group codes based on Kendall's correlation statistic
abstract
A coding scheme based on the properties of rank vectors is presented. The new codes are based on the theory of permutation groups by introducing a new notation for the group operation that simplifies the generation and decoding of desirable rank codes. The use of group theory is made possible by the introduction of the Kendall correlation coefficient as a measure of the distance between code words. This technique provides a method for the choice of rank vector code words superior to those that have been proposed in the past. Much of the terminology used in block coding can also be used to describe rank vector codes, but the actual quantities involved are quite different. The rank vector codes discussed in the paper offer the advantage of low sensitivity of the probability of error to the noise distribution because of the nonparametric character of rank vector detection schemes. Bounds that have been verified by extensive computer simulation have been derived for the probability of error.
Henry D. Chadwick, Ludwik Kurz
IEEE Trans. Inf. Theory1
1968 Two Sequential Nonparametric Detection Procedures
Henry D. Chadwick, Ludwik Kurz
Inf. Control.1