EDBT 2026 Demo / reviewers in the wild / expert
Parv Agarwal
dblp:379/6171
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0003-8921-8961ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 since 2021
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 · 67% Information theory · 33% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
channel capacity |
0.9 | 1 | 2025 | Coding Over Coupon Collector Channels for Combinatorial Motif-Based DNA Storage · IEEE Trans. Commun. 2025 |
Coding theory
channel coding |
0.9 | 1 | 2025 | Coding Over Coupon Collector Channels for Combinatorial Motif-Based DNA Storage · IEEE Trans. Commun. 2025 |
Coding theory › error-correcting codes › storage coding › DNA storage
DNA storage codes |
0.9 | 1 | 2025 | Coding Over Coupon Collector Channels for Combinatorial Motif-Based DNA Storage · IEEE Trans. Commun. 2025 |
Methods — techniques the papers use, named apart from their topics
coding scheme design · 0.9channel capacity analysis · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Coding Over Coupon Collector Channels for Combinatorial Motif-Based DNA StorageabstractEncoding information in combinations of pre-synthesised deoxyribonucleic acid (DNA) strands (referred to as motifs) is an interesting approach to DNA storage that could potentially circumvent the prohibitive costs of nucleotide-by-nucleotide DNA synthesis. Based on our analysis of an empirical data set from HelixWorks, we propose two channel models for this setup (with and without interference) and analyse their fundamental limits. We propose a coding scheme that approaches those limits by leveraging all information available at the output of the channel, in contrast to earlier schemes developed for a similar setup by Preuss et al. We highlight an important connection between channel capacity curves and the fundamental trade-off between synthesis (writing) and sequencing (reading) costs, and offer a way to mitigate an exponential growth in decoding complexity with the size of the motif library. Roman Sokolovskii, Parv Agarwal, Luis Alberto Croquevielle, Thomas Heinis |
IEEE Trans. Commun. | 2 |