EDBT 2026 Demo / reviewers in the wild / expert

Vladimir Shevelev

dblp:45/4790 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2003
0000-0003-4830-9480ORCID · corroborated

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

Theory of computation · 2

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding		 0.122003
Distance distributions in ensembles of irregular low-density parity-check codes · IEEE Trans. Inf. Theory 2003
On ensembles of low-density parity-check codes: Asymptotic distance distributions · IEEE Trans. Inf. Theory 2002
Coding theory
distance distribution		 0.122003
Distance distributions in ensembles of irregular low-density parity-check codes · IEEE Trans. Inf. Theory 2003
On ensembles of low-density parity-check codes: Asymptotic distance distributions · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes
LDPC codes		 0.122003
Distance distributions in ensembles of irregular low-density parity-check codes · IEEE Trans. Inf. Theory 2003
On ensembles of low-density parity-check codes: Asymptotic distance distributions · IEEE Trans. Inf. Theory 2002
Coding theory
code ensembles		 0.012002
On ensembles of low-density parity-check codes: Asymptotic distance distributions · IEEE Trans. Inf. Theory 2002

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

asymptotic analysis · 0.1bipartite graph representation · 0.0
YearPublicationVenuePosition
2003 Distance distributions in ensembles of irregular low-density parity-check codes
abstract
We derive asymptotic expressions for the average distance distributions in ensembles of irregular low-density parity-check (LDPC) codes. The ensembles are defined by matrices with given profiles of column and row sums.
Simon Litsyn, Vladimir Shevelev
 IEEE Trans. Inf. Theory2
2002 On ensembles of low-density parity-check codes: Asymptotic distance distributions
abstract
We derive expressions for the average distance distributions in several ensembles of regular low-density parity-check codes (LDPC). Among these ensembles are the standard one defined by matrices having given column and row sums, ensembles defined by matrices with given column sums or given row sums, and an ensemble defined by bipartite graphs.
Simon Litsyn, Vladimir Shevelev
 IEEE Trans. Inf. Theory2