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

Jürgen Willms

dblp:116/2795 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

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

Security and privacy · 1Theory of computation · 1 · 1 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
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › pseudorandom sequences
autocorrelation
0.212013
Autocorrelations of Binary Sequences and Run Structure · IEEE Trans. Inf. Theory 2013
Coding theory › sequences
binary sequences
0.212013
Autocorrelations of Binary Sequences and Run Structure · IEEE Trans. Inf. Theory 2013
Coding theory › source coding › lossless compression
run-length coding
0.212013
Autocorrelations of Binary Sequences and Run Structure · IEEE Trans. Inf. Theory 2013
YearPublicationVenuePosition
2016 Barker sequences of odd length
Kai-Uwe Schmidt, Jürgen Willms
Des. Codes Cryptogr.2
2013 Autocorrelations of Binary Sequences and Run Structure
abstract
We analyze the connection between the autocorrelation of a binary sequence and its run structure given by the run length encoding. We show that both the periodic and the aperiodic autocorrelation of a binary sequence can be formulated in terms of the run structure. The run structure is given by the consecutive runs of the sequence. Let C = (C0, C1,..., Cn) denote the autocorrelation vector of a binary sequence and Δ the difference operator. We prove that the th component of Δ2(C) can be directly calculated by using the consecutive runs of total length k. In particular, this shows that the th autocorrelation is already determined by all consecutive runs of total length l <; k.In the aperiodic case, we show how the run vector can be efficiently calculated and give a characterization of skew-symmetric sequences in terms of their run length encoding.
Jürgen Willms
IEEE Trans. Inf. Theory1