VLDB 2026 Research / reviewers in the wild / expert
Lasse Kiviluoto
dblp:07/6978
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 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.
| Theoretical computer science
1 paper |
Coding theory · 87% Information theory · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › multiuser coding
binary adder channel |
0.1 | 1 | 2007 | New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5 · IEEE Trans. Inf. Theory 2007 |
Coding theory › error-correcting codes
uniquely decodable codes |
0.1 | 1 | 2007 | New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5 · IEEE Trans. Inf. Theory 2007 |
Information theory › network information theory
multiuser communication |
0.0 | 1 | 2007 | New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5 · IEEE Trans. Inf. Theory 2007 |
Methods — techniques the papers use, named apart from their topics
computer search · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5abstractNew uniquely decodable (UD) codes for 3-, 4-, and 5-user binary adder channels are obtained in a computer search. These codes improve the highest known rate of UD codes for such channels to (log2/600)6ap1.5381,1.75, and (log2/192)4ap1.8962, respectively Lasse Kiviluoto, Patric R. J. Östergård |
IEEE Trans. Inf. Theory | 1 |