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

Oleg F. Kurmaev

dblp:06/7801 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2011
—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 · 80% Combinatorics and discrete mathematics · 20%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
constant-weight codes
0.112011
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes · IEEE Trans. Inf. Theory 2011
Coding theory
constrained coding
0.112011
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes · IEEE Trans. Inf. Theory 2011
Coding theory › error-correcting codes › code construction
enumerative coding
0.112011
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes · IEEE Trans. Inf. Theory 2011
Combinatorics and discrete mathematics
generating functions
0.112011
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes · IEEE Trans. Inf. Theory 2011
Coding theory › constrained coding
runlength-limited codes
0.112011
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes · IEEE Trans. Inf. Theory 2011

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

recurrence relations · 0.1generating functions · 0.1cover's enumerative scheme · 0.1
YearPublicationVenuePosition
2011 Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
abstract
Constant-weight and constant-charge binary sequences with constrained run length of zeros are introduced. The weight and charge distribution for these sequences are found. Next, recurrent and direct formulas for calculating the number of these sequences are obtained. By considering these numbers of constant-weight and constant-charge run-length limited (RLL) sequences as coefficients of convergent power series, generating functions are derived. The fact that generating function for enumerating constant-charge RLL sequences does not have a closed form is proved. Subsequently, implementation of encoding and decoding procedures using Cover's enumerative scheme is shown. Based on the obtained results, some examples, such as enumeration of running-digital sum (RDS) constrained RLL sequences or peak-shifts control capability are also provided.
Oleg F. Kurmaev
IEEE Trans. Inf. Theory1