Pascale Charpin
- Artificial Intelligence top 0.5%
- Electrical and Electronic Engineering top 5%
- Discrete Mathematics and Combinatorics top 1%
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 5%
- Co-authors
- Anne CanteautVictor ZinovievClaude CarletGohar KyureghyanThierry Pierre BergerHans DobbertinCéline BlondeauEnes Pašalić
- Topics
- Coding theory and cryptography (61 papers)graph theory and CDMA systems (41 papers)Cryptographic Implementations and Security (14 papers)
In The Last Decade
Pascale Charpin
64 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 31
- Artificial Intelligence 1.8k
- Electrical and Electronic Engineering 1.2k
- Discrete Mathematics and Combinatorics 347
- Computational Theory and Mathematics 342
- Computer Networks and Communications 238
Countries citing papers authored by Pascale Charpin
This map shows the geographic impact of Pascale Charpin'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 Pascale Charpin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascale Charpin more than expected).
Fields of papers citing papers by Pascale Charpin
This network shows the impact of papers produced by Pascale Charpin. 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 Pascale Charpin. The network helps show where Pascale Charpin may publish in the future.
Co-authorship network of co-authors of Pascale Charpin
This figure shows the co-authorship network connecting the top 25 collaborators of Pascale Charpin. A scholar is included among the top collaborators of Pascale Charpin 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 Pascale Charpin. Pascale Charpin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 16 | |
| 2 | 14 | |
| 3 | Open problems on cyclic codes | 40 |
| 4 | 53 | |
| 5 | 7 | |
| 6 | 73 | |
| 7 | 26 | |
| 8 | On almost perfect nonlinear mappings over F n 2 . | 2 |
| 9 | 1 | |
| 10 | 16 | |
| 11 | 24 | |
| 12 | 42 | |
| 13 | 2 | |
| 14 | 68 | |
| 15 | 358 | |
| 16 | 9 | |
| 17 | Eurocode '92 : International Symposium on Coding Theory and Applications | 2 |
| 18 | 28 | |
| 19 | 15 | |
| 20 | 4 |
About Pascale Charpin
Pascale Charpin is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence and Computational Theory and Mathematics, having authored 65 papers that have together received 1.8k indexed citations. Recurring topics across this work include Coding theory and cryptography (61 papers), graph theory and CDMA systems (41 papers) and Cryptographic Implementations and Security (14 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (347 citations), Artificial Intelligence (1.8k citations) and Electrical and Electronic Engineering (1.2k citations). Pascale Charpin has collaborated with scholars based in France, Russia and Norway. Frequent co-authors include Anne Canteaut, Victor Zinoviev, Claude Carlet, Gohar Kyureghyan, Thierry Pierre Berger, Hans Dobbertin, Céline Blondeau, Enes Pašalić, Guang Gong and Tor Helleseth. Their work appears in journals such as IEEE Transactions on Information Theory, Discrete Applied Mathematics and Discrete Mathematics.
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.