EDBT 2026 Demo / reviewers in the wild / expert
Yves Edel
dblp:e/YvesEdel
· DBLP profile ↗
17ranked-venue papers
11as first author
0since 2021 · last 2014
0009-0004-3419-4867ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 12 · 8 first-authorTheory 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
5 papers |
Coding theory · 99% Combinatorics and discrete mathematics · 1% |
Topics — the 13 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › block codes › linear code
code parameters |
0.1 | 2 | 2009 | Short Additive Quaternary Codes · IEEE Trans. Inf. Theory 2009 New code parameters from Reed-Solomon subfield codes · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes
additive codes |
0.1 | 1 | 2009 | Short Additive Quaternary Codes · IEEE Trans. Inf. Theory 2009 |
Coding theory › error-correcting codes
optimal codes |
0.1 | 1 | 2009 | Short Additive Quaternary Codes · IEEE Trans. Inf. Theory 2009 |
Coding theory › error-correcting codes › additive codes
quaternary additive codes |
0.1 | 1 | 2009 | Short Additive Quaternary Codes · IEEE Trans. Inf. Theory 2009 |
Coding theory › cryptographic function
APN functions |
0.1 | 1 | 2006 | A new APN function which is not equivalent to a power mapping · IEEE Trans. Inf. Theory 2006 |
Coding theory
cryptographic function |
0.1 | 1 | 2006 | A new APN function which is not equivalent to a power mapping · IEEE Trans. Inf. Theory 2006 |
Coding theory › finite fields
power mapping |
0.1 | 1 | 2006 | A new APN function which is not equivalent to a power mapping · IEEE Trans. Inf. Theory 2006 |
Coding theory › error-correcting codes › block codes
linear code |
0.1 | 3 | 1998 | Inverting Construction Y1 · IEEE Trans. Inf. Theory 1998 Lengthening and the Gilbert-Varshamov bound · IEEE Trans. Inf. Theory 1997 New code parameters from Reed-Solomon subfield codes · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes
code construction |
0.0 | 2 | 1998 | Inverting Construction Y1 · IEEE Trans. Inf. Theory 1998 Lengthening and the Gilbert-Varshamov bound · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
gilbert-varshamov bound |
0.0 | 1 | 1997 | Lengthening and the Gilbert-Varshamov bound · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes
reed-solomon codes |
0.0 | 1 | 1997 | New code parameters from Reed-Solomon subfield codes · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes › block codes › linear code
subfield codes |
0.0 | 1 | 1997 | New code parameters from Reed-Solomon subfield codes · IEEE Trans. Inf. Theory 1997 |
Combinatorics and discrete mathematics › combinatorial design
orthogonal arrays |
0.0 | 1 | 1997 | New code parameters from Reed-Solomon subfield codes · IEEE Trans. Inf. Theory 1997 |
Methods — techniques the papers use, named apart from their topics
geometric method · 0.1duality · 0.0closure operation on databases · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | The structure of quaternary quantum caps
Jürgen Bierbrauer, Daniele Bartoli, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco, Yves Edel |
Des. Codes Cryptogr. | 6 |
| 2010 | Galois geometries and applications
Jan De Beule, Yves Edel, Emilia Käsper, Andreas Klein 0001, Svetla Nikova, Bart Preneel, Jeroen Schillewaert, Leo Storme |
Des. Codes Cryptogr. | 2 |
| 2010 | On quadratic APN functions and dimensional dual hyperovals
Yves Edel |
Des. Codes Cryptogr. | 1 |
| 2010 | On multiple caps in finite projective spaces
Yves Edel, Ivan N. Landjev |
Des. Codes Cryptogr. | 1 |
| 2009 | On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions
Yves Edel, Alexander Pott |
IMACC | 1 |
| 2009 | Short Additive Quaternary CodesabstractIn this paper, the best parameters of quaternary additive codes of small length are determined using the geometric description. Only one open question remains for length les 13. Among the results obtained in this work are the nonexistence of [12, 7, 5]-codes and [12, 4.5, 7]-codes as well as the existence of a [13, 7.5, 5]-code. Jürgen Bierbrauer, Yves Edel, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco |
IEEE Trans. Inf. Theory | 2 |
| 2008 | Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )
Yves Edel |
Des. Codes Cryptogr. | 1 |
| 2006 | A new APN function which is not equivalent to a power mappingabstractA new almost-perfect nonlinear function (APN) on F(2/sup 10/) which is not equivalent to any of the previously known APN mappings is constructed. This is the first example of an APN mapping which is not equivalent to a power mapping. Yves Edel, Gohar M. Kyureghyan, Alexander Pott |
IEEE Trans. Inf. Theory | 1 |
| 2005 | A Family of Binary (t, m, s)-Nets of Strength 5
Jürgen Bierbrauer, Yves Edel |
Des. Codes Cryptogr. | 2 |
| 2004 | Extensions of Generalized Product Caps
Yves Edel |
Des. Codes Cryptogr. | 1 |
| 2003 | The Largest Cap in AG(4, 4) and Its Uniqueness
Yves Edel, Jürgen Bierbrauer |
Des. Codes Cryptogr. | 1 |
| 2001 | Large Caps in Small Spaces
Yves Edel, Jürgen Bierbrauer |
Des. Codes Cryptogr. | 1 |
| 1999 | 41 is the Largest Size of a Cap in PG(4, 4)
Yves Edel, Jürgen Bierbrauer |
Des. Codes Cryptogr. | 1 |
| 1998 | Inverting Construction Y1abstractWe introduce a computer-based method for extending linear codes, which can be viewed as an inverse of the familiar construction Y/sub 1/. As a result codes with record-breaking parameters are constructed. Yves Edel, Jürgen Bierbrauer |
IEEE Trans. Inf. Theory | 1 |
| 1997 | New code parameters from Reed-Solomon subfield codesabstractWe determine the dimensions of subfield codes of Reed-Solomon codes and construct certain extensions and lengthenings of these codes. We start from the duals, using the language of orthogonal arrays. As a first result this allows us to obtain a fair number of improvements in the list of binary, ternary, and quaternary linear codes with largest known minimal distance. Jürgen Bierbrauer, Yves Edel |
IEEE Trans. Inf. Theory | 2 |
| 1997 | Lengthening and the Gilbert-Varshamov boundabstractWe use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of record-breaking codes. Our main theorem may be seen as a closure operation on databases. Yves Edel, Jürgen Bierbrauer |
IEEE Trans. Inf. Theory | 1 |
| 1996 | Some t-Homogeneous Sets of Permutations
Jürgen Bierbrauer, Stephen Black, Yves Edel |
Des. Codes Cryptogr. | 3 |