Demo Data from EDBT 2026 / reviewers in the wild / expert
Galina T. Bogdanova
dblp:36/4475
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2008
0000-0002-5463-4274ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1
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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › constant-weight codes
constant-composition codes |
0.0 | 1 | 2002 | Bounds and constructions for ternary constant-composition codes · IEEE Trans. Inf. Theory 2002 |
Coding theory › error-correcting codes › coding metrics
hamming distance |
0.0 | 1 | 2002 | Bounds and constructions for ternary constant-composition codes · IEEE Trans. Inf. Theory 2002 |
Methods — techniques the papers use, named apart from their topics
computer search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Using error-correcting dependencies for collaborative filtering
Galina T. Bogdanova, Tsvetanka Georgieva-Trifonova |
Data Knowl. Eng. | 1 |
| 2002 | Bounds and constructions for ternary constant-composition codesabstractThe problem of determining the maximum size of a ternary code is considered, under the restriction that each symbol should appear a given number of times in each codeword. Upper and lower bounds on the size of such codes under the Hamming metric are discussed, where the lower bounds follow from constructions of good codes. Some of the results are obtained by explicitly finding codes by computer search. A table of exact values and best known bounds on the maximum size for codes of length at most 10 is presented. Mattias Svanström, Patric R. J. Östergård, Galina T. Bogdanova |
IEEE Trans. Inf. Theory | 3 |
| 2001 | Error-Correcting Codes over an Alphabet of Four Elements
Galina T. Bogdanova, Andries E. Brouwer, Stoyan N. Kapralov, Patric R. J. Östergård |
Des. Codes Cryptogr. | 1 |