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 VLDB 2026 / reviewers in the wild / expert

Oleg Skopintsev

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

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

Theory of computation · 1

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
convolutional codes		 0.011999
On the error exponent for woven convolutional codes with outer warp · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › decoding › decoding problems
decoding complexity		 0.011999
On the error exponent for woven convolutional codes with outer warp · IEEE Trans. Inf. Theory 1999
Coding theory › channel coding
error exponent		 0.011999
On the error exponent for woven convolutional codes with outer warp · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › convolutional codes
woven convolutional code		 0.011999
On the error exponent for woven convolutional codes with outer warp · IEEE Trans. Inf. Theory 1999

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

error exponent analysis · 0.0decoding complexity analysis · 0.0
YearPublicationVenuePosition
1999 On the error exponent for woven convolutional codes with outer warp
abstract
In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.
Victor V. Zyablov, Sergo Shavgulidze, Oleg Skopintsev, Stefan Höst, Rolf Johannesson
 IEEE Trans. Inf. Theory3