EDBT 2026 Demo / reviewers in the wild / expert

Stephan R. Cavior

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

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

Theory 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes		 0.011975
An upper bound associated with errors in Gray code (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory › error-correcting codes › combinatorial coding theory
gray codes		 0.011975
An upper bound associated with errors in Gray code (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory › source coding
binary encoding		 0.011975
An upper bound associated with errors in Gray code (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory
source coding		 0.011975
An upper bound associated with errors in Gray code (Corresp.) · IEEE Trans. Inf. Theory 1975

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

combinatorial proof · 0.0
YearPublicationVenuePosition
1975 An upper bound associated with errors in Gray code (Corresp.)
abstract
Suppose0 \leq i,j \leq 2^n - 1. We prove that, ifi,jare encoded as binary Gray codewords whose Hamming distance ism \geq 1, then\mid i-j \mid < 2^n - 2^m /3.
Stephan R. Cavior
 IEEE Trans. Inf. Theory1