Cunsheng Ding
Impact in
-
- Finite Group Theory Research
- Artificial Intelligence top 0.05%
- Coding theory and cryptography
- Cryptographic Implementations and Security
Papers in
-
- Finite Group Theory Research 25
-
- Coding theory and cryptography 184
- Cryptographic Implementations and Security 42
- Co-authors
- Jin YuanTor HellesethZhengchun ZhouClaude CarletHarald NiederreiterChunming TangChengju LiZiling Heng
In The Last Decade
Cunsheng Ding
208 papers receiving 7.7k citations
Peers
Comparison fields: 5 of 92
- Discrete Mathematics and Combinatorics 1.1k
- Artificial Intelligence 7.3k
- Computational Theory and Mathematics 1.8k
- Electrical and Electronic Engineering 6.2k
- Computer Networks and Communications 2.4k
Countries citing papers authored by Cunsheng Ding
This map shows the geographic impact of Cunsheng Ding'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 Cunsheng Ding with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Cunsheng Ding more than expected).
Fields of papers citing papers by Cunsheng Ding
This network shows the impact of papers produced by Cunsheng Ding. 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 Cunsheng Ding. The network helps show where Cunsheng Ding may publish in the future.
Co-authors
The 25 scholars most cited alongside Cunsheng Ding, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 2 | |
| 2 | 2023 | 11 | |
| 3 | 2023 | 7 | |
| 4 | 2023 | 2 | |
| 5 | 2022 | 1 | |
| 6 | 2022 | 9 | |
| 7 | 2021 | 2 | |
| 8 | Steiner systems S(2, 4, 3 m -1/2) and 2-designs from ternary linear codes of length 3 m -1/2. | 2019 | 1 |
| 9 | 2019 | 29 | |
| 10 | 2014 | 26 | |
| 11 | A general construction of authentication codes | 2007 | 18 |
| 12 | Secret Sharing Schemes with Nice Access Structures | 2006 | 16 |
| 13 | On Some Problems of Mateescu Concerning Subword Occurrences | 2006 | 22 |
| 14 | A cyclotomic construction of some constant weight cyclically permutable codes | 2002 | 1 |
| 15 | Progress in Cryptography - INDOCRYPT 2001 | 2001 | 1 |
| 16 | 2001 | 18 | |
| 17 | Generalized cyclotomic codes of length pe1· · · pet | 1999 | 8 |
| 18 | 1997 | 11 | |
| 19 | Linear complexity of generalized cyclotomic sequences of order 2 | 1997 | 2 |
| 20 | 1996 | 26 |
About Cunsheng Ding
Cunsheng Ding is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence, Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications, having authored 219 papers that have together received 8.1k indexed citations. Recurring topics across this work include Coding theory and cryptography (184 papers), graph theory and CDMA systems (135 papers), Cryptographic Implementations and Security (42 papers), Cellular Automata and Applications (36 papers), Cooperative Communication and Network Coding (33 papers), Finite Group Theory Research (25 papers), VLSI and Analog Circuit Testing (13 papers) and Error Correcting Code Techniques (13 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.1k citations), Artificial Intelligence (7.3k citations), Computational Theory and Mathematics (1.8k citations), Electrical and Electronic Engineering (6.2k citations) and Computer Networks and Communications (2.4k citations). Cunsheng Ding has collaborated with scholars based in Hong Kong, China and Singapore. Frequent co-authors include Jin Yuan, Tor Helleseth, Zhengchun Zhou, Claude Carlet, Harald Niederreiter, Chunming Tang, Chengju Li, Ziling Heng, Jianxing Yin and Pingzhi Yuan. Their work appears in journals such as IEEE Transactions on Information Theory, Finite Fields and Their Applications, Designs Codes and Cryptography, Discrete Mathematics and Cryptography and Communications.
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.