Demo Data from VLDB 2026 / reviewers in the wild / expert
Andrei Vityaev
dblp:62/11126
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 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.
| Computer networks
1 paper |
Physical-layer communications · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
channel coding |
0.0 | 1 | 1998 | On Viterbi detector path metric differences · IEEE Trans. Commun. 1998 |
Storage systems › magnetic recording
partial response channels |
0.0 | 1 | 1998 | On Viterbi detector path metric differences · IEEE Trans. Commun. 1998 |
Methods — techniques the papers use, named apart from their topics
maximum-likelihood sequence detection · 0.0linear programming bounds · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | On the performance of parity codes in magnetic recording systemsabstractWe investigate the performance of single and multiple parity codes in magnetic recording systems. We evaluate the codes with respect to bit error rate as well as error correction code (ECC) failure rate. While multiple parity codes outperform the single parity code in bit error rate, their performance is worse with respect to the ECC failure rate. Weishi Feng, Andrei Vityaev, Greg Burd, Nersi Nazari |
GLOBECOM | 2 |
| 1998 | On Viterbi detector path metric differencesabstractThis letter continues the investigation of methods for computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. New upper and lower estimates for these bounds are presented and recast in terms of a collection of linear programming problems. These estimates improve upon previously proposed linear programming bounds. The estimates are applied to derive exact bounds or provably close to exact bounds for several Viterbi detectors corresponding to coded and uncoded partial-response channels of practical interest in digital magnetic and optical recording. Andrei Vityaev, Paul H. Siegel |
IEEE Trans. Commun. | 1 |