Demo Data from EDBT 2026 / reviewers in the wild / expert
Johan P. Hansen
dblp:62/2517
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0002-7214-5204ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 3 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
4 papers |
Quantum computing and quantum information · 62% Coding theory · 27% Combinatorics and discrete mathematics · 6% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
algebraic geometry code |
0.2 | 3 | 2013 | Quantum Codes From Toric Surfaces · IEEE Trans. Inf. Theory 2013 Determination of Error Values for Algebraic-Geometry Codes and the Forney Formula · IEEE Trans. Inf. Theory 1998 Codes on the Klein quartic, ideals, and decoding · IEEE Trans. Inf. Theory 1987 |
Quantum computing and quantum information › quantum error correction
CSS codes |
0.2 | 1 | 2013 | Quantum Codes From Toric Surfaces · IEEE Trans. Inf. Theory 2013 |
Quantum computing and quantum information › quantum error correction
quantum code |
0.2 | 1 | 2013 | Quantum Codes From Toric Surfaces · IEEE Trans. Inf. Theory 2013 |
Quantum computing and quantum information
quantum error correction |
0.2 | 1 | 2013 | Quantum Codes From Toric Surfaces · IEEE Trans. Inf. Theory 2013 |
Combinatorics and discrete mathematics › topology
cohomology |
0.0 | 1 | 2013 | Quantum Codes From Toric Surfaces · IEEE Trans. Inf. Theory 2013 |
Coding theory › error-correcting codes
decoding |
0.0 | 2 | 1998 | Determination of Error Values for Algebraic-Geometry Codes and the Forney Formula · IEEE Trans. Inf. Theory 1998 Codes on the Klein quartic, ideals, and decoding · IEEE Trans. Inf. Theory 1987 |
Computational complexity
lower bounds |
0.0 | 1 | 2001 | Lower Bounds for Dynamic Algebraic Problems · Inf. Comput. 2001 |
Coding theory › error-correcting codes › block codes › group codes
group algebra code |
0.0 | 1 | 1987 | Codes on the Klein quartic, ideals, and decoding · IEEE Trans. Inf. Theory 1987 |
Methods — techniques the papers use, named apart from their topics
intersection theory · 0.2dualizing differential form · 0.2algebraic geometry over finite fields · 0.0group algebra · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Quantum Codes From Toric SurfacesabstractA theory for constructing quantum error correcting codes from Toric surfaces by the Calderbank-Shor-Steane method is presented. In particular, we study the method on toric Hirzebruch surfaces. The results are obtained by constructing a dualizing differential form for the toric surface and by using the cohomology and the intersection theory of toric varieties. Johan P. Hansen |
IEEE Trans. Inf. Theory | 1 |
| 2001 | Lower Bounds for Dynamic Algebraic Problems
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen |
Inf. Comput. | 2 |
| 1999 | Lower Bounds for Dynamic Algebraic Problems
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen |
STACS | 2 |
| 1998 | Determination of Error Values for Algebraic-Geometry Codes and the Forney FormulaabstractIn the decoding of one-point algebraic-geometry codes with one defining equation in two variables we generalize the Forney formula for the Bose-Chaudhuri-Hocqungham (BCH) codes. Johan P. Hansen, Helge Elbrønd Jensen, Ralf Koetter |
IEEE Trans. Inf. Theory | 1 |
| 1987 | Codes on the Klein quartic, ideals, and decodingabstractA sequence of codes with particular symmetries and with large rates compared to their minimal distances is constructed over the field GF(2^{3}). In the sequence there is, for instance, a code of length 21 and dimension10with minimal distance9, and a code of length21and dimension16with minimal distance3. The codes are constructed from algebraic geometry using the dictionary between coding theory and algebraic curves over finite fields established by Goppa. The curve used in the present work is the Klein quartic. This curve has the maximal number of rational points over GF(2^{3})allowed by Serre's improvement of the Hasse-Weil bound, which, together with the low genus, accounts for the good code parameters. The Klein quartic has the Frobenius groupGof order21acting as a group of automorphisms which accounts for the particular symmetries of the codes. In fact, the codes are given alternative descriptions as left ideals in the group-algebra GF(2^{3})[G]. This description allows for easy decoding. For instance, in the case of the single error correcting code of length21and dimension16with minimal distance3. decoding is obtained by multiplication with an idempotent in the group algebra. Johan P. Hansen |
IEEE Trans. Inf. Theory | 1 |