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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Ulf Henriksson

dblp:272/8130 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1972
—ORCID · none

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

Computer networks · 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 · 50% Information theory · 50%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › correlation function
autocorrelation sequences		 0.011972
On a Scrambling Property of Feedback Shift Registers · IEEE Trans. Commun. 1972
Coding theory › sequences
feedback shift registers		 0.011972
On a Scrambling Property of Feedback Shift Registers · IEEE Trans. Commun. 1972
YearPublicationVenuePosition
1972 On a Scrambling Property of Feedback Shift Registers
abstract
A scrambling property of binary feedback shift registers is investigated. When the input sequence has a certain defined randomness, the output symbols are uncorrelated everywhere, except possibly at symbol separations that are integer multiples of the exponent of the feedback polynomial. At those points the output autocorrelation is shown to be equal to higher order moments of the input sequence.
Ulf Henriksson
 IEEE Trans. Commun.1