Demo Data from VLDB 2026 / reviewers in the wild / expert
Per Håkan Lundow
dblp:32/6791
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory 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 · 67% Information theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
channel capacity |
0.1 | 1 | 2010 | The 1-vertex transfer matrix and accurate estimation of channel capacity · IEEE Trans. Inf. Theory 2010 |
Coding theory
constrained coding |
0.1 | 1 | 2010 | The 1-vertex transfer matrix and accurate estimation of channel capacity · IEEE Trans. Inf. Theory 2010 |
Coding theory › constrained coding
runlength-limited codes |
0.1 | 1 | 2010 | The 1-vertex transfer matrix and accurate estimation of channel capacity · IEEE Trans. Inf. Theory 2010 |
Methods — techniques the papers use, named apart from their topics
transfer matrix method · 0.1eigenvalue computation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | The 1-vertex transfer matrix and accurate estimation of channel capacityabstractThe notion of a 1-vertex transfer matrix for multidimensional codes is introduced. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the limit of the logarithm of spectral radii of 1-vertex transfer matrices. Storage and computations using the 1-vertex transfer matrix are much smaller than storage and computations needed for the standard transfer matrix. The method is applied to estimate the first 15 digits of the entropy of the 2-D(0, 1)run length limited channel. A large-scale computation of eigenvalues for the(0, 1)run length limited channel in 2-D and 3-D have been carried out. This was done in order to be able to compare the computational cost of the new method with the standard transfer matrix and have rigorous bounds to compare the estimates with. This in turn leads to improvements on the best previous lower and upper bounds for these channels. Shmuel Friedland, Per Håkan Lundow, Klas Markström |
IEEE Trans. Inf. Theory | 2 |