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

H. Butin

dblp:03/608 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1978
—ORCID · none

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

Systems, architecture and hardware · 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 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
orthogonal functions		 0.021978
On an Ordering of Walsh Functions · IEEE Trans. Computers 1978
A Compact Definition of Walsh Functions · IEEE Trans. Computers 1972

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

matrix definition · 0.0gray code · 0.0
YearPublicationVenuePosition
1978 On an Ordering of Walsh Functions
abstract
In addition to the automorphism between the sequency and the Gray-code-of-sequency ordering for Walsh functions there is also one for Kacsmarz ordering. This is shown by using a matrix definition suggested by K. W. Henderson some years ago [4].
H. Butin
 IEEE Trans. Computers1
1972 A Compact Definition of Walsh Functions
abstract
A polynomial definition of the Walsh functions (very similar to that used by Titsworth [9] or Pearl [7]) is shown to be equivalent to Pichler-Harmuth's formulas [3]. It gives an easy way to derive some properties of Walsh functions, such as their relationship with the Gray code or the shifting theorem.
H. Butin
 IEEE Trans. Computers1