VLDB 2026 Research / reviewers in the wild / expert
Anders Bjært Sørensen
dblp:83/4002
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 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
2 papers |
Coding theory · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
algebraic coding theory |
0.0 | 2 | 1992 | Weighted Reed-Muller codes and algebraic-geometric codes · IEEE Trans. Inf. Theory 1992 Projective Reed-Muller codes · IEEE Trans. Inf. Theory 1991 |
Coding theory › error-correcting codes
reed-muller codes |
0.0 | 2 | 1992 | Weighted Reed-Muller codes and algebraic-geometric codes · IEEE Trans. Inf. Theory 1992 Projective Reed-Muller codes · IEEE Trans. Inf. Theory 1991 |
Coding theory › error-correcting codes
algebraic geometry code |
0.0 | 1 | 1992 | Weighted Reed-Muller codes and algebraic-geometric codes · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › reed-muller codes
projective reed-muller codes |
0.0 | 1 | 1991 | Projective Reed-Muller codes · IEEE Trans. Inf. Theory 1991 |
Methods — techniques the papers use, named apart from their topics
subcode construction · 0.0duality · 0.0polynomial codes · 0.0cyclic properties · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Weighted Reed-Muller codes and algebraic-geometric codesabstractA generalization of the Reed-Muller codes, the weighted Reed-Muller codes, is presented. The code parameters are estimated and the duals are shown also to be weighted Reed-Muller codes. It is shown how the minimum distance of certain algebraic-geometric codes in many cases can be determined exactly or an upper bound can be found, using subcodes which are weighted Reed-Muller codes.> Anders Bjært Sørensen |
IEEE Trans. Inf. Theory | 1 |
| 1991 | Projective Reed-Muller codesabstractA class of codes in the Reed-Muller family, the projective Reed-Muller codes (PRM codes), is studied. The author defines the PRM codes of all orders and discusses their relation to polynomial codes. The exact parameters of PRM codes are given. The duals are characterized, and, in parallel to the classical works on generalized Reed-Muller codes, the cyclic properties are studied. Tables over parameters of the codes are given.> Anders Bjært Sørensen |
IEEE Trans. Inf. Theory | 1 |