Demo Data from EDBT 2026 / reviewers in the wild / expert
Axel Kohnert
dblp:47/1565
· DBLP profile ↗
7ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 4 first-authorSecurity and privacy · 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 · 87% Combinatorics and discrete mathematics · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › block codes
linear code |
0.1 | 1 | 2005 | Optimal linear codes from matrix groups · IEEE Trans. Inf. Theory 2005 |
Coding theory › error-correcting codes › block codes › linear code › code parameters
optimal linear codes |
0.1 | 1 | 2005 | Optimal linear codes from matrix groups · IEEE Trans. Inf. Theory 2005 |
Combinatorics and discrete mathematics › group theory
matrix groups |
0.0 | 1 | 2005 | Optimal linear codes from matrix groups · IEEE Trans. Inf. Theory 2005 |
Methods — techniques the papers use, named apart from their topics
symmetry reduction · 0.1diophantine equations · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | New bounds for codes over finite Frobenius rings
Eimear Byrne, Marcus Greferath, Axel Kohnert, Vitaly Skachek |
Des. Codes Cryptogr. | 3 |
| 2009 | Integral point sets over Znm
Axel Kohnert, Sascha Kurz |
Discret. Appl. Math. | 1 |
| 2009 | Construction of binary and ternary self-orthogonal linear codes
Axel Kohnert, Alfred Wassermann |
Discret. Appl. Math. | 1 |
| 2007 | Constructing two-weight codes with prescribed groups of automorphisms
Axel Kohnert |
Discret. Appl. Math. | 1 |
| 2005 | Optimal linear codes from matrix groupsabstractNew linear codes (sometimes optimal) over the finite field with q elements are constructed. In order to do this, an equivalence between the existence of a linear code with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations is used. To reduce the size of the system of equations, the search for solutions is restricted to solutions with special symmetry given by matrix groups. This allows to find more than 400 new codes for the case q=2,3,4,5,7,9. Axel Kohnert, Alfred Wassermann |
IEEE Trans. Inf. Theory | 2 |
| 1992 | SYMMETRICA, an Object Oriented Computer-Algebra System for the Symmetric Group
Adalbert Kerber, Axel Kohnert, Alain Lascoux |
J. Symb. Comput. | 2 |
| 1992 | Schubert Polynomials and Skew Schur Functions
Axel Kohnert |
J. Symb. Comput. | 1 |