Cunsheng Ding spends much of his time researching Discrete mathematics, Linear code, Combinatorics, Coding theory and Theoretical computer science. Cunsheng Ding has included themes like Differential cryptanalysis and Binary number in his Discrete mathematics study. When carried out as part of a general Linear code research project, his work on Cyclic code and Expander code is frequently linked to work in Weight distribution, therefore connecting diverse disciplines of study.
His Combinatorics study integrates concerns from other disciplines, such as Order, Paley construction and Group code. His Coding theory research incorporates elements of Chinese remainder theorem, Algebra and Cryptography. His Theoretical computer science research is multidisciplinary, incorporating elements of Shamir's Secret Sharing, Secret sharing, Access structure, Verifiable secret sharing and Homomorphic secret sharing.
His main research concerns Discrete mathematics, Combinatorics, Linear code, Block code and Finite field. His Coding theory study in the realm of Discrete mathematics interacts with subjects such as Weight distribution. His Combinatorics research is multidisciplinary, incorporating perspectives in Binary code and Hadamard transform.
He frequently studies issues relating to Concatenated error correction code and Linear code. The study incorporates disciplines such as Theoretical computer science and Turbo code in addition to Block code. His research in Theoretical computer science tackles topics such as Homomorphic secret sharing which are related to areas like Access structure.
Cunsheng Ding mostly deals with Discrete mathematics, Combinatorics, Linear code, Coding theory and Binary code. Cunsheng Ding combines subjects such as Secret sharing, Hamming code and Ternary operation with his study of Discrete mathematics. His work on Dual polyhedron as part of general Combinatorics study is frequently linked to Weight distribution and Projective linear group, therefore connecting diverse disciplines of science.
His research integrates issues of Binary Golay code, Prime power and Finite field in his study of Linear code. His research in Coding theory intersects with topics in Special functions, Code, Type, Class and Link. His work carried out in the field of Binary code brings together such families of science as Binary linear codes and Bent function.
His primary scientific interests are in Combinatorics, Binary code, Discrete mathematics, Hamming weight and Boolean function. His biological study spans a wide range of topics, including Hamming code and Code. His studies in Binary code integrate themes in fields like Binary linear codes and Bent function.
His Discrete mathematics research is multidisciplinary, relying on both Reed–Muller code, Linear code and Cryptography. The Secret sharing and Stream cipher research Cunsheng Ding does as part of his general Cryptography study is frequently linked to other disciplines of science, such as Robustness, therefore creating a link between diverse domains of science. His work deals with themes such as Coding theory and Steiner system, which intersect with Hamming weight.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The stability theory of stream ciphers
Cunsheng Ding;Guozhen Xiao;Weijuan Shan.
Stream Ciphers and Number Theory
Thomas W. Cusick;Cunsheng Ding;Ari Renvall.
Chinese remainder theorem: applications in computing, coding, cryptography
C. Ding;D. Pei;A. Salomaa.
Highly nonlinear mappings
Claude Carlet;Cunsheng Ding.
Journal of Complexity (2004)
A family of skew Hadamard difference sets
Cunsheng Ding;Jin Yuan.
Journal of Combinatorial Theory, Series A (2006)
Linear codes from perfect nonlinear mappings and their secret sharing schemes
C. Carlet;Cunsheng Ding;Jin Yuan.
IEEE Transactions on Information Theory (2005)
Secret sharing schemes from three classes of linear codes
Jin Yuan;Cunsheng Ding.
IEEE Transactions on Information Theory (2006)
Chinese remainder theorem
On the linear complexity of Legendre sequences
Cunsheng Ding;T. Hesseseth;Weijuan Shan.
IEEE Transactions on Information Theory (1998)
On almost perfect nonlinear permutations
T. Beth;C. Ding.
theory and application of cryptographic techniques (1994)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: