Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Philippe Langevin

dblp:61/1459 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
1since 2021 · last 2026
0000-0002-3661-048XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 4 first-authorTheory of computation · 5 · 2 first-author · 1 since 2021

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
3 papers
Coding theory · 80% Combinatorics and discrete mathematics · 15% Algorithms and data structures · 2%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
boolean functions
1.232026
Normality of 8-bit Bent Functions · IEEE Trans. Inf. Theory 2026
Counting Partial Spread Functions in Eight Variables · IEEE Trans. Inf. Theory 2011
A Counterexample to a Conjecture of Niho · IEEE Trans. Inf. Theory 2007
Coding theory › boolean functions
bent functions
1.122026
Normality of 8-bit Bent Functions · IEEE Trans. Inf. Theory 2026
Counting Partial Spread Functions in Eight Variables · IEEE Trans. Inf. Theory 2011
Combinatorics and discrete mathematics › combinatorial design
difference sets
0.312026
Normality of 8-bit Bent Functions · IEEE Trans. Inf. Theory 2026
Combinatorics and discrete mathematics
enumeration
0.112011
Counting Partial Spread Functions in Eight Variables · IEEE Trans. Inf. Theory 2011
Information theory
quadratic forms
0.112007
A Counterexample to a Conjecture of Niho · IEEE Trans. Inf. Theory 2007
Algorithms and data structures › linear algebra › linear algebra algorithms › fast transforms
walsh-hadamard transform
0.112007
A Counterexample to a Conjecture of Niho · IEEE Trans. Inf. Theory 2007

Methods — techniques the papers use, named apart from their topics

group action analysis · 0.1computational enumeration · 0.1quadratic form theory · 0.1counterexample construction · 0.1
YearPublicationVenuePosition
2026 Normality of 8-bit Bent Functions
abstract
Bent functions are Boolean functions in an even number of variables that are indicators of Hadamard difference sets in elementary abelian 2-groups. A bent functionfinmvariables is said to be normal if it is constant on an affine space of dimensionm/2. In this paper, we demonstrate that all bent functions in m = 8 variables, whose exact count, determined by Langevin and Leander (Des. Codes Cryptogr. 59(1–3): 193–205, 2011), is approximately 2106, share a common algebraic property: every 8-variable bent function is normal, up to the addition of a linear function. With this result, we complete the analysis of the normality of bent functions for the last unresolved case,m= 8. It is already known that all bent functions inmvariables are normal form≤ 6, while form≥ 10, there exist bent functions that cannot be made normal by adding linear functions. Consequently, we provide a complete solution to an open problem by Charpin (J. Complex. 20(2-3): 245-265, 2004).
Valérie Gillot, Philippe Langevin, Alexandr Polujan
IEEE Trans. Inf. Theory2
2019 Obituary of Jacques Wolfmann (1932-2018)
Pascale Charpin, Philippe Langevin
Des. Codes Cryptogr.2
2011 Counting all bent functions in dimension eight 99270589265934370305785861242880
Philippe Langevin, Gregor Leander
Des. Codes Cryptogr.1
2011 Counting Partial Spread Functions in Eight Variables
abstract
In this paper we report the following computational results on partial spread functions in eight variables: (i) the numbers of equivalence classes of partial spread functions (in eight variables) of all possible orders; (ii) the total number of partial spread bent functions in eight variables; (iii) the distribution of the cardinalities of stabilizers (in GL(8, F2)) of partial spread bent functions in eight variables. The computational method is also described.
Philippe Langevin, Xiang-dong Hou
IEEE Trans. Inf. Theory1
2010 Power Permutations in Dimension 32
Emrah Çakçak, Philippe Langevin
SETA2
2007 A Counterexample to a Conjecture of Niho
abstract
A conjecture of Niho states that under certain assumptions the Fourier transform of the function${\rm Tr}(x^{d})$on$\BBF _{2^{n}}$, where$d=(2^{tk}+1)/(2^{k}+1)$, has a spectrum with at most five values. We present a counterexample to this conjecture, and the theory behind finding it. We use the theory of quadratic forms over$\BBF _{2}$.
Philippe Langevin, Gregor Leander, Gary McGuire
IEEE Trans. Inf. Theory1
2005 On the Non-linearity of Power Functions
Philippe Langevin, Pascal Véron
Des. Codes Cryptogr.1
2005 Nonlinearity of Some Invariant Boolean Functions
Philippe Langevin, Jean-Pierre Zanotti
Des. Codes Cryptogr.1
2003 Classification of Boolean cubic forms of nine variables
abstract
We describe a new invariant that we have used to obtain the complete classification of the cubic forms of nine variables. In particular, we compute the covering radius of the Reed-Muller code RM(2, 9) into RM(3, 9).
Eric Brier, Philippe Langevin
ITW2
1998 Weights of Abelian Codes
Philippe Langevin
Des. Codes Cryptogr.1