EDBT 2026 Demo / reviewers in the wild / expert
Songping Ge
dblp:383/6726
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0005-7643-7641ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Theory of computation · 1 · 1 first-author · 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 · 75% Computational complexity · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › distributed storage › distributed storage codes
convertible code |
1.0 | 1 | 2026 | Locally Repairable Convertible Codes: Improved Lower Bound and General Construction · IEEE Trans. Inf. Theory 2026 |
Coding theory › distributed storage
distributed storage codes |
1.0 | 1 | 2026 | Locally Repairable Convertible Codes: Improved Lower Bound and General Construction · IEEE Trans. Inf. Theory 2026 |
Coding theory › distributed storage › distributed storage codes
locally repairable codes |
1.0 | 1 | 2026 | Locally Repairable Convertible Codes: Improved Lower Bound and General Construction · IEEE Trans. Inf. Theory 2026 |
Computational complexity
lower bounds |
1.0 | 1 | 2026 | Locally Repairable Convertible Codes: Improved Lower Bound and General Construction · IEEE Trans. Inf. Theory 2026 |
Methods — techniques the papers use, named apart from their topics
combinatorial construction · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Convertible Codes: A Polynomial Evaluation View
Songping Ge, Han Cai, Xiaohu Tang 0004 |
ISIT | 1 |
| 2026 | Convertible Minimum Storage Regenerating Codes
Songping Ge, Han Cai, Xiaohu Tang 0004 |
ISIT | 2 |
| 2026 | Locally Repairable Convertible Codes: Improved Lower Bound and General ConstructionabstractIn this paper, we consider convertible codes with the locally repairable property. We present an improved lower bound on access cost associated with (r, δ ⩾ 2)-locality, which extends the known lower bound only related tor.We then provide a general construction of convertible codes with optimal access cost which shows that these codes can have super-linear length or maximally recoverable property. Furthermore, we propose explicit constructions of convertible codes with the final code achieving super-linear length or maximally recoverable property when the initial codes have super-linear length or maximally recoverable property respectively. Specifically, compared with known constructions, our construction is applicable to the case δ > 2 for the first time. Songping Ge, Han Cai, Xiaohu Tang 0004 |
IEEE Trans. Inf. Theory | 1 |