Demo Data from EDBT 2026 / reviewers in the wild / expert
Vyacheslav V. Rykov
dblp:13/4713
· DBLP profile ↗
6ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4Theory 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
1 paper |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
concatenated codes |
0.0 | 1 | 2000 | New constructions of superimposed codes · IEEE Trans. Inf. Theory 2000 |
Coding theory › error-correcting codes
reed-solomon codes |
0.0 | 1 | 2000 | New constructions of superimposed codes · IEEE Trans. Inf. Theory 2000 |
Coding theory › error-correcting codes › block codes
superimposed codes |
0.0 | 1 | 2000 | New constructions of superimposed codes · IEEE Trans. Inf. Theory 2000 |
Methods — techniques the papers use, named apart from their topics
concatenation of constant-weight codes and shortened reed-solomon codes · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | On critical relative distance of DNA codes for additive stem similarityabstractWe consider DNA codes based on the nearest-neighbor (stem) similarity model which adequately reflects the “hybridization potential” of two DNA sequences. Our aim is to present a survey of bounds on the rate of DNA codes with respect to a thermodynamically motivated similarity measure called an additive stem similarity. These results yield a method to analyze and compare known samples of the nearest neighbor “thermo-dynamic weights” associated to stacked pairs that occurred in DNA secondary structures. Arkadii G. D'yachkov, A. N. Voronina, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov |
ISIT | 5 |
| 2008 | Random Coding Bounds for DNA codes based on Fibonacci ensembles of DNA sequencesabstractWe consider DNA codes based on the concept of a weighted 2-stem similarity measure which reflects the ldquohybridization potentialrdquo of two DNA sequences. A random coding bound on the rate of DNA codes with respect to a thermodynamic motivated similarity measure is proved. Ensembles of DNA strands whose sequence composition is restricted in a manner similar to the restrictions in binary Fibonacci sequences are introduced to obtain the bound. Arkadii G. D'yachkov, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov |
ISIT | 4 |
| 2007 | DNA Codes Based on Stem Similarities Between DNA Sequences
Arkadii G. D'yachkov, Anthony J. Macula, Vyacheslav V. Rykov, Vladimir Ufimtsev |
DNA | 3 |
| 2004 | Partition codesabstractWe introduce the distance concept between two q-ary n-sequences, 2/spl les/q Arkadii G. D'yachkov, Vyacheslav V. Rykov, David C. Torney, Sergey Yekhanin |
ISIT | 2 |
| 2004 | Trivial two-stage group testing for complexes using almost disjunct matrices
Anthony J. Macula, Vyacheslav V. Rykov, Sergey Yekhanin |
Discret. Appl. Math. | 2 |
| 2000 | New constructions of superimposed codesabstractKautz-Singleton (1964) suggested a class of binary superimposed codes which are based on the q-ary Reed-Solomon codes (RS codes). Applying a concatenation of the binary constant-weight error-correcting codes and the shortened RS codes, we obtain new constructions of superimposed codes. Tables of their parameters are given. From the tables it follows that the rate of obtained codes exceeds the corresponding random coding bound. Arkadii G. D'yachkov, Anthony J. Macula, Vyacheslav V. Rykov |
IEEE Trans. Inf. Theory | 3 |