EDBT 2026 Demo / reviewers in the wild / expert
Matti J. Aaltonen
dblp:74/5060 · also Matti Aaltonen
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-authorComputer networks · 2
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
3 papers |
Coding theory · 87% Information theory · 13% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › channel coding
asymptotic information rate |
0.0 | 1 | 1984 | Notes on the asymptotic behavior of the information rate of block codes · IEEE Trans. Inf. Theory 1984 |
Coding theory › error-correcting codes
block codes |
0.0 | 1 | 1984 | Notes on the asymptotic behavior of the information rate of block codes · IEEE Trans. Inf. Theory 1984 |
Coding theory › interactive communication
tree codes |
0.0 | 2 | 1979 | Linear programming bounds for tree codes (Corresp.) · IEEE Trans. Inf. Theory 1979 An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.) · IEEE Trans. Inf. Theory 1977 |
Information theory › channel capacity
information rate |
0.0 | 1 | 1979 | Linear programming bounds for tree codes (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Coding theory › error-correcting codes › coding bounds
linear programming bounds |
0.0 | 1 | 1979 | Linear programming bounds for tree codes (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Methods — techniques the papers use, named apart from their topics
asymptotic analysis · 0.0markov chain · 0.0linear programming · 0.0delsarte theory of association schemes · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Two approaches to bringing Internet services to WAP devices
Eija Kaasinen, Matti J. Aaltonen, Juha Kolari, Suvi Melakoski, Timo Laakko |
Comput. Networks | 2 |
| 1999 | Integrated Multimedia Publishing: Combining TV and Newspaper Content on Personal Channels
Caj Södergård, Matti J. Aaltonen, Sari Hagman, Mikko Hiirsalmi, Timo Järvinen, Eija Kaasinen, Timo Kinnunen, Juha Kolari, Jouko Kunnas, Antti Tammela |
Comput. Networks | 2 |
| 1984 | Notes on the asymptotic behavior of the information rate of block codesabstractThe behavior of the signaling rate of error-correcting codes of lengthnand minimum distanced_{n}is studied in the limit for largenwhen the sequenced_{n}/napproaches a prescribed limit\delta. A functionR(\delta)representating the asymptotic signaling rate is defined and is shown to be continuous. Matti J. Aaltonen |
IEEE Trans. Inf. Theory | 1 |
| 1979 | Linear programming bounds for tree codes (Corresp.)abstractTwo asymptotic upper bounds on the information rate of a tree code as a function of its feedback decoding minimum distance are presented. These bounds are generalizations of the linear programming bounds for binary block codes proved by McEliece et al., and they are derived from linear programming problems based on Delsarte's theory of association schemes. Matti J. Aaltonen |
IEEE Trans. Inf. Theory | 1 |
| 1977 | An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)abstractAn asymptotic Hamming bound for tree codes is derived. This bound is not new, it has been obtained earlier by Pinsker. However, Markov chains were used by Pinsker in its proof whereas more direct methods are used here. Matti J. Aaltonen |
IEEE Trans. Inf. Theory | 1 |