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.

Idris David Mercer

dblp:55/4541 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
—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
0.422016
Bounding the Peak Sidelobe Level of Binary Sequences of All Lengths · IEEE Trans. Inf. Theory 2016
Merit Factor of Chu Sequences and Best Merit Factor of Polyphase Sequences · IEEE Trans. Inf. Theory 2013
Coding theory › sequences
binary sequences
0.212016
Bounding the Peak Sidelobe Level of Binary Sequences of All Lengths · IEEE Trans. Inf. Theory 2016
Coding theory › sequences › sequence design › correlation properties
peak sidelobe level
0.212016
Bounding the Peak Sidelobe Level of Binary Sequences of All Lengths · IEEE Trans. Inf. Theory 2016
Coding theory › sequences › binary sequences
merit factor
0.212013
Merit Factor of Chu Sequences and Best Merit Factor of Polyphase Sequences · IEEE Trans. Inf. Theory 2013
Coding theory › sequences › sequence design
polyphase sequences
0.212013
Merit Factor of Chu Sequences and Best Merit Factor of Polyphase Sequences · IEEE Trans. Inf. Theory 2013
Coding theory › sequences › sequence design › polyphase sequences
zadoff-chu sequences
0.212013
Merit Factor of Chu Sequences and Best Merit Factor of Polyphase Sequences · IEEE Trans. Inf. Theory 2013

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

probabilistic method · 0.2analytic proof · 0.2
YearPublicationVenuePosition
2016 Bounding the Peak Sidelobe Level of Binary Sequences of All Lengths
abstract
Improving upon 2010 results of Alon et al., it was shown in 2014 by Schmidt that asymptotically, almost all binary sequences of length n have peak sidelobe level close to (2n log n)1/2. One specific result of Alon et al. is that if we fix ε > 0, then almost all binary sequences of length n have peak sidelobe level at most (2n(log n - (1.5 - ε) log log n))1/2, in the sense that the probability of not satisfying that bound approaches 0 as n approaches infinity. In this note, we prove that for all sequence lengths n > 1, there is a binary sequence of length n with peak sidelobe level at most (2n(log n - log log n + 0.862))1/2.
Idris David Mercer
IEEE Trans. Inf. Theory1
2013 Merit Factor of Chu Sequences and Best Merit Factor of Polyphase Sequences
abstract
Chu sequences are a family of polyphase sequences that have perfect periodic autocorrelations and good aperiodic autocorrelations. It has previously been proved that the maximum offpeak (aperiodic) autocorrelation (in absolute value) of the Chu sequence of length n is asymptotically equal to 0.480261√n. It has also been empirically observed that the merit factor of Chu sequences appears to grow like a constant times √n. In this note, we provide an analytic proof that the merit factor of the Chu sequence of length n is bounded below by a constant multiple of √n for all n. To the author's knowledge, this is the first time a family of polyphase sequences of all lengths has been proved to have merit factor growing at least like order √n.
Idris David Mercer
IEEE Trans. Inf. Theory1