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

Kevin J. Player

dblp:95/4692 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

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

Security and privacy · 2Theory of computation · 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
1 paper
Coding theory · 64% Combinatorics and discrete mathematics · 36%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › combinatorial design
difference sets
0.212015
Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation · IEEE Trans. Inf. Theory 2015
Coding theory › sequences
p-ary sequences
0.212015
Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation · IEEE Trans. Inf. Theory 2015
Coding theory › sequences
sequence design
0.212015
Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation · IEEE Trans. Inf. Theory 2015
Combinatorics and discrete mathematics › combinatorial design
block design
0.112015
Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation · IEEE Trans. Inf. Theory 2015
Coding theory › error-correcting codes › combinatorial coding theory
weighing matrix
0.112015
Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation · IEEE Trans. Inf. Theory 2015

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

existence criterion · 0.2character sum factorization · 0.2
YearPublicationVenuePosition
2015 Character Sum Factorizations Yield Sequences With Ideal Two-Level Autocorrelation
abstract
We give a new existence criterion for p-ary sequences which have ideal two-level autocorrelation; and we use it to obtain four general families of such sequences: one for p=2, one for general odd primes p and two special ones for p=3. The binary family turns out to be equivalent to that discovered by Dillon and Dobbertin and published in 2004. The general p-ary family is equivalent to that discovered by Gong and Helleseth, by Dillon and, when p=3, by Helleseth, Kumar, and Martinsen. All of these p-ary results were published in 2001 and 2002. The special ternary families are new and give as special cases the sequences conjectured by Alfred Lin in his 1998 Ph.D. thesis as well as most of those conjectured in 2001 by Ludkovski and Gong. Our sequences may also be used to construct (relative) difference sets, their corresponding block designs and generalized weighing matrices.
Krishnasamy Thiru Arasu, John F. Dillon, Kevin J. Player
IEEE Trans. Inf. Theory3
2007 Abelian difference sets of order n dividing lambda
Krishnasamy Thiru Arasu, Yu Qing Chen, John F. Dillon, Xiaoyu Liu 0009, Kevin J. Player
Des. Codes Cryptogr.5
2003 A New Family of Cyclic Difference Sets with Singer Parameters in Characteristic Three
Krishnasamy Thiru Arasu, Kevin J. Player
Des. Codes Cryptogr.2