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.
VLDB 2026 Research / reviewers in the wild / expert

H. D. Luke

dblp:81/2280 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

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

Theory of computation · 2 · 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
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences
sequence design		 0.021997
Binary odd-periodic complementary sequences · IEEE Trans. Inf. Theory 1997
Almost-perfect polyphase sequences with small phase alphabet · IEEE Trans. Inf. Theory 1997
Coding theory › sequences › sequence design › correlation properties
almost-perfect autocorrelation		 0.011997
Almost-perfect polyphase sequences with small phase alphabet · IEEE Trans. Inf. Theory 1997
Coding theory › sequences
complementary sequences		 0.011997
Binary odd-periodic complementary sequences · IEEE Trans. Inf. Theory 1997
Coding theory › sequences › sequence design
polyphase sequences		 0.011997
Almost-perfect polyphase sequences with small phase alphabet · IEEE Trans. Inf. Theory 1997
Coding theory › sequences › pseudorandom sequences
m-sequences		 0.021997
Binary odd-periodic complementary sequences · IEEE Trans. Inf. Theory 1997
Almost-perfect polyphase sequences with small phase alphabet · IEEE Trans. Inf. Theory 1997

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

sequence construction · 0.0character operation · 0.0
YearPublicationVenuePosition
1997 Almost-perfect polyphase sequences with small phase alphabet
abstract
New classes of polyphase sequences with small phase alphabets of size k are presented. These almost-perfect sequences of length N have a vanishing periodic autocorrelation function /spl Theta/(/spl tau/) for all /spl tau//spl ne/0 mod (N/k). The sequences are derived from q-ary m-sequences by a k-valued character operation.
H. D. Luke
 IEEE Trans. Inf. Theory1
1997 Binary odd-periodic complementary sequences
abstract
A pair of binary sequences is called complementary if the sum of their aperiodic autocorrelation functions is zero except for zero shift. Such sequences are known for relatively few lengths. This correspondence therefore introduces pairs of binary odd-periodic complementary sequences, which can be constructed using q-ary m-sequences for many more lengths.
H. D. Luke
 IEEE Trans. Inf. Theory1