Demo Data from EDBT 2026 / reviewers in the wild / expert
Vladimir V. Chepyzhov
dblp:07/6787
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2000
0000-0003-2472-8672ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-authorTheory 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 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
convolutional codes |
0.0 | 1 | 1992 | The free distance of fixed convolutional rate 2/4 codes meets the Costello bound · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › convolutional codes
free distance |
0.0 | 1 | 1992 | The free distance of fixed convolutional rate 2/4 codes meets the Costello bound · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › convolutional codes › convolutional encoders
time-varying convolutional codes |
0.0 | 1 | 1992 | The free distance of fixed convolutional rate 2/4 codes meets the Costello bound · IEEE Trans. Inf. Theory 1992 |
Methods — techniques the papers use, named apart from their topics
branch length analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers
Vladimir V. Chepyzhov, Thomas Johansson 0001, Ben J. M. Smeets |
FSE | 1 |
| 1992 | The free distance of fixed convolutional rate 2/4 codes meets the Costello boundabstractThe long standing question whether the free distance of fixed rate convolutional codes is as good as the Costello bound was almost solved by K.S. Zigangirov and J.L. Massey (1987). They proved that this is indeed the case for codes with long branch length and rates 2/c, c>or=5. It is shown that there exist fixed convolutional codes of rate 2/4 whose free distance d/sub free/ meets the Costello bound originally derived for time varying convolutional codes.> Vladimir V. Chepyzhov, Ben J. M. Smeets, Kamil Sh. Zigangirov |
IEEE Trans. Inf. Theory | 1 |