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

Peter B. Borwein

dblp:36/3402 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2005
—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 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design › low-correlation sequence
barker sequence
0.112005
Polyphase sequences with low autocorrelation · IEEE Trans. Inf. Theory 2005
Coding theory › sequences › binary sequences
low autocorrelation binary sequences
0.112005
Polyphase sequences with low autocorrelation · IEEE Trans. Inf. Theory 2005
Coding theory › sequences › sequence design
polyphase sequences
0.112005
Polyphase sequences with low autocorrelation · IEEE Trans. Inf. Theory 2005
Coding theory › sequences
sequence design
0.112005
Polyphase sequences with low autocorrelation · IEEE Trans. Inf. Theory 2005
Coding theory › sequences
binary sequences
0.012004
Binary sequences with merit factor greater than 6.34 · IEEE Trans. Inf. Theory 2004
Coding theory › sequences › binary sequences
merit factor
0.012004
Binary sequences with merit factor greater than 6.34 · IEEE Trans. Inf. Theory 2004

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

stochastic optimization · 0.1calculus-based local search · 0.1numerical experimentation · 0.0
YearPublicationVenuePosition
2005 Polyphase sequences with low autocorrelation
abstract
Low autocorrelation for sequences is usually described in terms of low base energy, i.e., the sum of the sidelobe energies, or the maximum modulus of its autocorrelations, a Barker sequence occurring when this value is /spl les/ 1. We describe first an algorithm applying stochastic methods and calculus to the problem of finding polyphase sequences that are good local minima for the base energy. Starting from these, a second algorithm uses calculus to locate sequences that are local minima for the maximum modulus on autocorrelations. In our tabulation of smallest base energies found at various lengths, statistical evidence suggests we have good candidates for global minima or ground states up to length 45. We extend the list of known polyphase Barker sequences to length 63.
Peter B. Borwein, Ron Ferguson
IEEE Trans. Inf. Theory1
2004 Binary sequences with merit factor greater than 6.34
abstract
The maximum known asymptotic merit factor for binary sequences has been stuck at a value of 6 since the 1980s. Several authors have suggested that this value cannot be improved. In this paper, we construct an infinite family of binary sequences whose asymptotic merit factor we conjecture to be greater than 6.34. We present what we believe to be compelling evidence in support of this conjecture. The numerical experimentation that led to this construction is a significant part of the story.
Peter B. Borwein, Kwok-Kwong Stephen Choi, Jonathan Jedwab
IEEE Trans. Inf. Theory1