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

Victor D. Kolesnik

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

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

Theory of computation · 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 · 65% Information theory · 35%

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

TopicWeightPapersLastEvidence papers
Coding theory
constrained coding		 0.011994
Lower bounds on achievable rates for limited bitshift correcting codes · IEEE Trans. Inf. Theory 1994
Coding theory › constrained coding
runlength-limited codes		 0.011991
Generating functions and lower bounds on rates for limited error-correcting codes · IEEE Trans. Inf. Theory 1991
Coding theory › error-correcting codes
minimum hamming distance		 0.011991
Generating functions and lower bounds on rates for limited error-correcting codes · IEEE Trans. Inf. Theory 1991

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

combinatorial analysis · 0.0trellis diagram · 0.0generating functions · 0.0
YearPublicationVenuePosition
1994 Lower bounds on achievable rates for limited bitshift correcting codes
abstract
Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance d/sub BS/ of a code. For a given /spl delta/=d/sub BS//n, where n is the code length, the achievable code rate R/sub /spl alpha// is lower bounded. We prove the existence of codes of rate R/spl ges/R/sub /spl alpha//.>
Victor D. Kolesnik, Victor Yu. Krachkovsky
 IEEE Trans. Inf. Theory1
1991 Generating functions and lower bounds on rates for limited error-correcting codes
abstract
Runlength-limited (RLL) and digital-sum-limited (DSL) codes are considered. For these codes the finite and asymptotic lower bounds on achievable rates for the given minimum Hamming distance are derived. Using generating functions and trellis diagram techniques, the authors prove the existence of RLL- and DSL-codes of rate R and minimum distance d= delta n, such that R>or=2.log lambda /sub 1/(0)-min(log lambda /sub 1/(z)- delta .log z), 0>
Victor D. Kolesnik, Victor Yu. Krachkovsky
 IEEE Trans. Inf. Theory1