Philippe Langevin

726 total citations
27 papers, 182 citations indexed

About

Philippe Langevin is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Philippe Langevin has authored 27 papers receiving a total of 182 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Artificial Intelligence, 16 papers in Electrical and Electronic Engineering and 10 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Philippe Langevin's work include Coding theory and cryptography (24 papers), graph theory and CDMA systems (16 papers) and Finite Group Theory Research (9 papers). Philippe Langevin is often cited by papers focused on Coding theory and cryptography (24 papers), graph theory and CDMA systems (16 papers) and Finite Group Theory Research (9 papers). Philippe Langevin collaborates with scholars based in France, United States and Czechia. Philippe Langevin's co-authors include Gregor Leander, Xiang‐dong Hou, Patrick Solé, Éric Brier, Jay A. Wood, Faruk Göloğlu, Daniel Katz, Pascal Véron and Daniel J. Katz and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of Combinatorial Theory Series A and Journal of Pure and Applied Algebra.

In The Last Decade

Philippe Langevin

25 papers receiving 172 citations

Peers

Philippe Langevin
Philippe Langevin
Citations per year, relative to Philippe Langevin Philippe Langevin (= 1×) peers Patrick Felke

Countries citing papers authored by Philippe Langevin

Since Specialization
Citations

This map shows the geographic impact of Philippe Langevin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Philippe Langevin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philippe Langevin more than expected).

Fields of papers citing papers by Philippe Langevin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Philippe Langevin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Philippe Langevin. The network helps show where Philippe Langevin may publish in the future.

Co-authorship network of co-authors of Philippe Langevin

This figure shows the co-authorship network connecting the top 25 collaborators of Philippe Langevin. A scholar is included among the top collaborators of Philippe Langevin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Philippe Langevin. Philippe Langevin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Langevin, Philippe, et al.. (2023). Covering radius of $ RM(4,8) $. Advances in Mathematics of Communications. 18(2). 383–393.
2.
Langevin, Philippe, et al.. (2023). Classification of some cosets of the Reed-Muller code. Cryptography and Communications. 15(6). 1129–1137. 1 indexed citations
3.
Göloğlu, Faruk & Philippe Langevin. (2020). Almost perfect nonlinear families which are not equivalent to permutations. Finite Fields and Their Applications. 67. 101707–101707. 3 indexed citations
4.
Langevin, Philippe, et al.. (2016). Deux analogues au déterminant de Maillet. Comptes Rendus Mathématique. 354(7). 649–652. 4 indexed citations
5.
Katz, Daniel & Philippe Langevin. (2015). Proof of a conjectured three-valued family of Weil sums of binomials. Acta Arithmetica. 169(2). 181–199. 3 indexed citations
6.
Katz, Daniel J., et al.. (2014). Cyclotomie des sommes de Weil binomiales. Comptes Rendus Mathématique. 352(5). 373–376.
7.
Langevin, Philippe, et al.. (2011). Counting Partial Spread Functions in Eight Variables. IEEE Transactions on Information Theory. 57(4). 2263–2269. 3 indexed citations
8.
Langevin, Philippe & Gregor Leander. (2008). Monomial bent functions and Stickelberger's theorem. Finite Fields and Their Applications. 14(3). 727–742. 17 indexed citations
9.
Langevin, Philippe. (2007). Marseille et ses quartiers: une ville à construire. 15–30. 1 indexed citations
10.
Langevin, Philippe, et al.. (2005). Nonlinearity of Some Invariant Boolean Functions. Designs Codes and Cryptography. 36(2). 131–146. 2 indexed citations
11.
Langevin, Philippe & Pascal Véron. (2005). On the Non-linearity of Power Functions. Designs Codes and Cryptography. 37(1). 31–43. 4 indexed citations
12.
Brier, Éric & Philippe Langevin. (2004). Classification of Boolean cubic forms of nine variables. 179–182. 9 indexed citations
13.
Solé, Patrick & Philippe Langevin. (2000). Duadic Z4-codes. 167–167. 2 indexed citations
14.
Langevin, Philippe & Patrick Solé. (2000). Duadic Z4-Codes. Finite Fields and Their Applications. 6(4). 309–326. 8 indexed citations
15.
Langevin, Philippe. (1998). Weights of Abelian Codes. Designs Codes and Cryptography. 14(3). 239–245. 1 indexed citations
16.
Hou, Xiang‐dong & Philippe Langevin. (1997). Results on Bent Functions. Journal of Combinatorial Theory Series A. 80(2). 232–246. 34 indexed citations
17.
Langevin, Philippe. (1997). Calculs de Certaines Sommes de Gauss. Journal of Number Theory. 63(1). 59–64. 23 indexed citations
18.
Langevin, Philippe. (1995). Regular Sections Groups. Finite Fields and Their Applications. 1(4). 405–411. 2 indexed citations
19.
Langevin, Philippe, et al.. (1995). Linear Codes with Balanced Weight Distribution. Applicable Algebra in Engineering Communication and Computing. 6(4). 299–299. 1 indexed citations
20.
Langevin, Philippe. (1994). Regular section groups. Finite Fields and Their Applications. 1(4). 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026