Demo Data from EDBT 2026 / reviewers in the wild / expert
Herbert Taylor
dblp:71/7013
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4Security and privacy · 1
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 · 91% Combinatorics and discrete mathematics · 9% | |
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
sequences |
0.0 | 1 | 1993 | Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols · IEEE Trans. Inf. Theory 1993 |
Physical-layer communications › synchronization
frame synchronization |
0.0 | 1 | 1987 | Acquisition sequences in PPM communications · IEEE Trans. Inf. Theory 1987 |
Physical-layer communications
signal detection |
0.0 | 1 | 1987 | Acquisition sequences in PPM communications · IEEE Trans. Inf. Theory 1987 |
Coding theory › sequences › pseudorandom sequences
autocorrelation properties |
0.0 | 1 | 1987 | Acquisition sequences in PPM communications · IEEE Trans. Inf. Theory 1987 |
Coding theory › sequences
sequence design |
0.0 | 1 | 1987 | Acquisition sequences in PPM communications · IEEE Trans. Inf. Theory 1987 |
Combinatorics and discrete mathematics
combinatorial design |
0.0 | 1 | 1982 | Two-dimensional synchronization patterns for minimum ambiguity · IEEE Trans. Inf. Theory 1982 |
Coding theory › sequences
pseudorandom sequences |
0.0 | 1 | 1982 | Two-dimensional synchronization patterns for minimum ambiguity · IEEE Trans. Inf. Theory 1982 |
Physical-layer communications › modulation
pulse position modulation |
0.0 | 1 | 1987 | Acquisition sequences in PPM communications · IEEE Trans. Inf. Theory 1987 |
Methods — techniques the papers use, named apart from their topics
shearing transformation · 0.0rotation transformation · 0.0multiplication transformation · 0.0combinatorial sequence design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Cyclic Projective Planes, Perfect Circular Rulers, and Good Spanning Rulers
Solomon W. Golomb, Herbert Taylor |
SETA | 2 |
| 1993 | Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbolsabstractThe authors construct new and improved sonar sequences by applying rotation, multiplication, and shearing transformations to Costas sequence constructions. A catalog of the best known sonar sequences with up to 100 symbols is given.> Oscar Moreno, Richard A. Games, Herbert Taylor |
IEEE Trans. Inf. Theory | 3 |
| 1987 | Acquisition sequences in PPM communicationsabstractIn pulse position modulation (PPM) communications an acquisition sequence is needed to establish frame synchronization for subsequent data transmission. This sequence must have PPM structure (one pulse per frame) and desirable autocorrelation properties for its detection. The problem of finding aperiodic PPM acquisition sequences having the minimum possible autocorrelation for all off-shifted positions is investigated. Sequences with the maximum possible number of frames have been found up to frame size15. Examples are given for every frame length up to88, and powers of two up to1024. An interesting relation between the PPM sequence problem, Costas and sonar arrays, and Golomb's ruler is explored. Robert M. Gagliardi, J. Robbins, Herbert Taylor |
IEEE Trans. Inf. Theory | 3 |
| 1982 | Two-dimensional synchronization patterns for minimum ambiguityabstractA number of closely related combinatorial problems corresponding to specific assumptions about the type of time-frequency sequence which may be appropriate in a particular application, are formulated in terms of square or rectangular arrays of dots with appropriate constraints on the two-dimensional correlation function. The current state of knowledge concerning each of these problems is summarized. It is hoped that more general constructions may be found, leading to larger families of solutions, as well as better computational algorithms for finding individual solutions which may lie outside of the general families. Solomon W. Golomb, Herbert Taylor |
IEEE Trans. Inf. Theory | 2 |