| 2009 | ||
|---|---|---|
| 74 | Cunsheng Ding: A Class of Three-Weight and Four-Weight Codes. IWCC 2009: 34-42 | |
| 73 | Cunsheng Ding: The Weight Distribution of Some Irreducible Cyclic Codes. IEEE Transactions on Information Theory 55(3): 955-960 (2009) | |
| 72 | Cunsheng Ding: Optimal and perfect difference systems of sets. J. Comb. Theory, Ser. A 116(1): 109-119 (2009) | |
| 71 | Ying Cai, Cunsheng Ding: Binary sequences with optimal autocorrelation. Theor. Comput. Sci. 410(24-25): 2316-2322 (2009) | |
| 2008 | ||
| 70 | Cunsheng Ding, Tao Feng: Codebooks from almost difference sets. Des. Codes Cryptography 46(1): 113-126 (2008) | |
| 69 | Cunsheng Ding, Tor Helleseth, Øyvind Ytrehus: Preface. Des. Codes Cryptography 48(2): 109-110 (2008) | |
| 68 | Cunsheng Ding, Jianxing Yin: Constructions of almost difference families. Discrete Mathematics 308(21): 4941-4954 (2008) | |
| 67 | Cunsheng Ding: Optimal Constant Composition Codes From Zero-Difference Balanced Functions. IEEE Transactions on Information Theory 54(12): 5766-5770 (2008) | |
| 66 | Cunsheng Ding, Jianxing Yin: Sets of Optimal Frequency-Hopping Sequences. IEEE Transactions on Information Theory 54(8): 3741-3745 (2008) | |
| 2007 | ||
| 65 | Cunsheng Ding, Tao Feng: A Generic Construction of Complex Codebooks Meeting the Welch Bound. IEEE Transactions on Information Theory 53(11): 4245-4250 (2007) | |
| 64 | Cunsheng Ding, Tor Helleseth, Torleiv Kløve, X. Wang: A Generic Construction of Cartesian Authentication Codes. IEEE Transactions on Information Theory 53(6): 2229-2235 (2007) | |
| 63 | Cunsheng Ding, Harald Niederreiter: Cyclotomic Linear Codes of Order 3. IEEE Transactions on Information Theory 53(6): 2274-2277 (2007) | |
| 62 | Cunsheng Ding, Marko J. Moisio, Jin Yuan: Algebraic Constructions of Optimal Frequency-Hopping Sequences. IEEE Transactions on Information Theory 53(7): 2606-2610 (2007) | |
| 61 | Cunsheng Ding, Zeying Wang, Qing Xiang: Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG(3, 32h+1). J. Comb. Theory, Ser. A 114(5): 867-887 (2007) | |
| 2006 | ||
| 60 | Claude Carlet, Cunsheng Ding, Harald Niederreiter: Authentication Schemes from Highly Nonlinear Functions. Des. Codes Cryptography 40(1): 71-79 (2006) | |
| 59 | Cunsheng Ding, Jianxing Yin: A Construction of Optimal Constant Composition Codes. Des. Codes Cryptography 40(2): 157-165 (2006) | |
| 58 | Yanxun Chang, Cunsheng Ding: Constructions of External Difference Families and Disjoint Difference Families. Des. Codes Cryptography 40(2): 167-185 (2006) | |
| 57 | Cunsheng Ding, Arto Salomaa: Secret Sharing Schemes with Nice Access Structures. Fundam. Inform. 73(1-2): 51-63 (2006) | |
| 56 | Cunsheng Ding, Arto Salomaa: On Some Problems of Mateescu Concerning Subword Occurrences. Fundam. Inform. 73(1-2): 65-79 (2006) | |
| 55 | Jin Yuan, Cunsheng Ding: Secret sharing schemes from three classes of linear codes. IEEE Transactions on Information Theory 52(1): 206-212 (2006) | |
| 54 | Jin Yuan, Claude Carlet, Cunsheng Ding: The weight distribution of a class of linear codes from perfect nonlinear functions. IEEE Transactions on Information Theory 52(2): 712-717 (2006) | |
| 53 | Cunsheng Ding, Jin Yuan: A family of skew Hadamard difference sets. J. Comb. Theory, Ser. A 113(7): 1526-1535 (2006) | |
| 2005 | ||
| 52 | Cunsheng Ding, Jin Yuan: A family of optimal constant-composition codes. IEEE Transactions on Information Theory 51(10): 3668-3671 (2005) | |
| 51 | Cunsheng Ding, Jianxing Yin: Combinatorial constructions of optimal constant-composition codes. IEEE Transactions on Information Theory 51(10): 3671-3674 (2005) | |
| 50 | Cunsheng Ding, Jianxing Yin: Algebraic constructions of constant composition codes. IEEE Transactions on Information Theory 51(4): 1585-1589 (2005) | |
| 49 | Claude Carlet, Cunsheng Ding, Jin Yuan: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Transactions on Information Theory 51(6): 2089-2102 (2005) | |
| 48 | Cunsheng Ding, Xuesong Wang: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1): 81-99 (2005) | |
| 2004 | ||
| 47 | Cunsheng Ding, Xiaojian Tian: Three Constructions of Authentication Codes with Perfect Secrecy. Des. Codes Cryptography 33(3): 227-239 (2004) | |
| 46 | Cunsheng Ding, Chaoping Xing: Cyclotomic Optical Orthogonal Codes of Composite Lengths. IEEE Transactions on Communications 52(2): 263-268 (2004) | |
| 45 | Cunsheng Ding, Harald Niederreiter: Systematic authentication codes from highly nonlinear functions. IEEE Transactions on Information Theory 50(10): 2421-2428 (2004) | |
| 44 | Chun-Pong Lai, Cunsheng Ding: Several Generalizations Of Shamir's Secret Sharing Scheme. Int. J. Found. Comput. Sci. 15(2): 445-458 (2004) | |
| 43 | Cunsheng Ding, Chaoping Xing: Special issue on cryptography and coding theory. J. Complexity 20(2-3): 133- (2004) | |
| 42 | Cunsheng Ding, Chaoping Xing: A short biography of Harald Niederreiter. J. Complexity 20(2-3): 134-136 (2004) | |
| 41 | Claude Carlet, Cunsheng Ding: Highly nonlinear mappings. J. Complexity 20(2-3): 205-244 (2004) | |
| 2003 | ||
| 40 | Cunsheng Ding, Arto Salomaa, Patrick Solé, Xiaojian Tian: Three Constructions of Authentication/Secrecy Codes. AAECC 2003: 24-33 | |
| 39 | Cunsheng Ding, Jin Yuan: Covering and Secret Sharing with Linear Codes. DMTCS 2003: 11-25 | |
| 38 | Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve: Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Des. Codes Cryptography 30(1): 73-84 (2003) | |
| 37 | Cunsheng Ding, Chaoping Xing: Several Classes of (2m-1, w, 2) Optical Orthogonal Codes. Discrete Applied Mathematics 128(1): 103-120 (2003) | |
| 36 | Jin Yuan, Cunsheng Ding: Secret Sharing Schemes from Two-Weight Codes. Electronic Notes in Discrete Mathematics 15: 232 (2003) | |
| 35 | Chaoping Xing, P. Vijay Kumar, Cunsheng Ding: Low-correlation, large linear span sequences from function fields. IEEE Transactions on Information Theory 49(6): 1439-1446 (2003) | |
| 34 | T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, Matthew G. Parker: Logarithm cartesian authentication codes. Inf. Comput. 184(1): 93-108 (2003) | |
| 33 | Samuel T. Chanson, Cunsheng Ding, Arto Salomaa: Cartesian authentication codes from functions with optimal nonlinearity. Theor. Comput. Sci. 290(3): 1737-1752 (2003) | |
| 2002 | ||
| 32 | Cunsheng Ding, Tor Helleseth, Harald Niederreiter, Chaoping Xing: The minimum distance of the duals of binary irreducible cyclic codes. IEEE Transactions on Information Theory 48(10): 2679-2689 (2002) | |
| 31 | Cunsheng Ding, Fang-Wei Fu, Torleiv Kløve, Victor K.-W. Wei: Constructions of permutation arrays. IEEE Transactions on Information Theory 48(4): 977-980 (2002) | |
| 2001 | ||
| 30 | C. Pandu Rangan, Cunsheng Ding: Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings Springer 2001 | |
| 29 | Cunsheng Ding, Torleiv Kløve, Francesco Sica: Two classes of ternary codes and their weight distributions. Discrete Applied Mathematics 111(1-2): 37-53 (2001) | |
| 28 | Cunsheng Ding, Chaoping Xing: Several Classes of (2m - 1, w, 2) Optical Orthogonal Codes. Electronic Notes in Discrete Mathematics 6: 72-97 (2001) | |
| 27 | Cunsheng Ding, Tor Helleseth, Halvard Martinsen: New families of binary sequences with optimal three-level autocorrelation. IEEE Transactions on Information Theory 47(1): 428-433 (2001) | |
| 26 | K. T. Arasu, Cunsheng Ding, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen: Almost difference sets and their sequences with optimal autocorrelation. IEEE Transactions on Information Theory 47(7): 2934-2943 (2001) | |
| 2000 | ||
| 25 | Cunsheng Ding, Tor Helleseth, Kwok-Yan Lam: Duadic sequences of prime lengths. Discrete Mathematics 218(1-3): 33-49 (2000) | |
| 24 | Cunsheng Ding, David R. Kohel, San Ling: Elementary 2-group character codes. IEEE Transactions on Information Theory 46(1): 280-284 (2000) | |
| 23 | Cunsheng Ding, David R. Kohel, San Ling: Split group codes. IEEE Transactions on Information Theory 46(2): 485-495 (2000) | |
| 22 | Cunsheng Ding, Harald Niederreiter, Chaoping Xing: Some new codes from algebraic curves. IEEE Transactions on Information Theory 46(7): 2638-2642 (2000) | |
| 21 | Cunsheng Ding, David R. Kohel, San Ling: Secret-sharing with a class of ternary codes. Theor. Comput. Sci. 246(1-2): 285-298 (2000) | |
| 1999 | ||
| 20 | Cunsheng Ding, Kwok-Yan Lam, Chaoping Xing: Construction and Enumeration of All Binary Duadic Codes of Length pm. Fundam. Inform. 38(1-2): 149-161 (1999) | |
| 19 | Cunsheng Ding, Vera Pless: Cyclotomy and Duadic Codes of Prime Lengths. IEEE Transactions on Information Theory 45(2): 453-466 (1999) | |
| 18 | Cunsheng Ding, Tor Helleseth: Generalized Cyclotomic Codes of Length p1e1 ... ptet. IEEE Transactions on Information Theory 45(2): 467-474 (1999) | |
| 17 | Cunsheng Ding, Tor Helleseth, Kwok-Yan Lam: Several classes of binary sequences with three-level autocorrelation. IEEE Transactions on Information Theory 45(7): 2606-2612 (1999) | |
| 1998 | ||
| 16 | Ross J. Anderson, Cunsheng Ding, Tor Helleseth, Torleiv Kløve: How to Build Robust Shared Control Systems. Des. Codes Cryptography 15(2): 111-124 (1998) | |
| 15 | Cunsheng Ding, Tor Helleseth, Weijuan Shan: On the Linear Complexity of Legendre Sequences. IEEE Transactions on Information Theory 44(3): 1276-1278 (1998) | |
| 14 | Cunsheng Ding: Pattern Distributions of Legendre Sequences. IEEE Transactions on Information Theory 44(4): 1693-1698 (1998) | |
| 13 | Cunsheng Ding: Autocorrelation Values of Generalized Cyclotomic Sequences of Order Two. IEEE Transactions on Information Theory 44(4): 1699-1702 (1998) | |
| 12 | Cunsheng Ding, Tor Helleseth: On Cyclotomic Generator of Order r. Inf. Process. Lett. 66(1): 21-25 (1998) | |
| 1997 | ||
| 11 | Cunsheng Ding, Valtteri Niemi, Ari Renvall, Arto Salomaa: TWOPRIME: A Fast Stream Ciphering Algorithm. FSE 1997: 88-102 | |
| 10 | Cunsheng Ding, Tero Laihonen, Ari Renvall: Linear Multisecret-Sharing Schemes and Error-Correcting Codes. J. UCS 3(9): 1023-1036 (1997) | |
| 1996 | ||
| 9 | Ari Renvall, Cunsheng Ding: A nonlinear secret sharing scheme. ACISP 1996: 56-66 | |
| 8 | Ari Renvall, Cunsheng Ding: The access structure of some secret-sharing schemes. ACISP 1996: 67-78 | |
| 7 | Cunsheng Ding, Arto Salomaa: On Cooperatively Distributed Ciphering and Hashing. Computers and Artificial Intelligence 15(2-3): (1996) | |
| 1994 | ||
| 6 | Cunsheng Ding: Binary Cyclotomic Generators. FSE 1994: 29-60 | |
| 1993 | ||
| 5 | Thomas Beth, Cunsheng Ding: On Almost Perfect Nonlinear Permutations. EUROCRYPT 1993: 65-76 | |
| 4 | Cunsheng Ding: The Differential Cryptanalysis and Design of Natural Stream Ciphers. FSE 1993: 101-115 | |
| 1991 | ||
| 3 | Cunsheng Ding, Guozhen Xiao, Weijuan Shan: The Stability Theory of Stream Ciphers Springer 1991 | |
| 1990 | ||
| 2 | Cunsheng Ding: Lower Bounds on the Weight Complexities of Cascaded Binary Sequences. AUSCRYPT 1990: 39-43 | |
| 1988 | ||
| 1 | Cunsheng Ding: Proof of Massey's Conjectured Algorithm. EUROCRYPT 1988: 345-349 | |