Professor LING San

| Home | Research Interest | Publications | Book Publications | Links |
Papers in Journals
  1. S. Ling & J. Oesterlé, The Shimura subgroup of Jo(N). Astérisque 196 – 197, 171 – 203 (1991)
  2. S. Ling, Congruences between cusp forms and the geometry of Jacobians of modular curves. Mathematische Annalen 295, 111 – 133 (1993)
  3. Y.M. Chee & S. Ling, Projective covering designs. Bulletin of the London Mathematical Society 25, 231 – 239 (1993)
  4. S. Ling, Shimura subgroups of Jacobians of Shimura curves. Proceedings of the American Mathematical Society 118, 385 – 390 (1993)
  5. S. Ling, The old subvariety of Jo(pq) and the Eisenstein kernel in Jacobians. Israel Journal of Mathematics 84, 365 – 384 (1993)
  6. S. Ling, The Fitting ideal of Jo(q)(Fp^n) over the Hecke algebra. Journal of Algebra 164, 563 – 575 (1994)
  7. S. Ling, Shimura subgroups and degeneracy maps. Journal of Number Theory 54, 39 – 59  (1995)
  8. S. Ling, On the Q-rational cuspidal subgroup and the component group of Jo(pr). Israel Journal of Mathematics 99, 29 – 54 (1997)
  9. S.K. Chua & S. Ling, On the rational cuspidal subgroup and the rational torsion points of Jo(pq).  Proceedings of the American Mathematical Society 125, 2255 – 2263  (1997)
  10. K.H. Leung, S. Ling, S.L. Ma, K.B. Tay, Almost perfect sequences with q = 2. Archiv der Mathematik 70, 128 – 131 (1998)
  11. S. Ling, On component groups of Jo(N) and degeneracy maps. Proceedings of the American Mathematical Society 126, 3201 – 3210 (1998)
  12. Y.M. Chee & S. Ling, Combinatorial coverings from geometries over principal ideal rings. Journal of Combinatorial Designs 7, 247 – 268 (1999)
  13. S.K. Chua, K.H. Leung & S. Ling, Attack on RSA-type cryptosystems based on singular cubic curves over Z/nZ. Theoretical Computer Science 226, 19 – 27 (1999)
  14. K.H. Leung & S. Ling, The rank of a Latin square associated to an abelian group. Communications in Algebra 28, 1141 – 1155 (2000)
  15. C. Ding, D.R. Kohel & S. Ling, Elementary 2-group character codes. IEEE Transactions on Information Theory 46, 280 – 284 (2000)
  16. C. Ding, D.R. Kohel & S. Ling, Split group codes. IEEE Transactions on Information Theory 46, 485 – 495 (2000)
  17. S. Ling, Component group of the p-new subvariety of Jo(Mp). Israel Journal of Mathematics 116, 117 – 123 (2000)
  18. C. Xing & S. Ling, A class of linear codes with good parameters from algebraic curves. IEEE Transactions on Information Theory 46, 1527 – 1532 (2000)
  19. C. Xing & S. Ling, A class of linear codes with good parameters. IEEE Transactions on Information Theory 46, 2184 – 2188 (2000)
  20. C. Ding, D.R. Kohel & S. Ling, Secret sharing with a class of ternary codes. Theoretical Computer Science 246, 285 – 298 (2000)
  21. S. Ling, H. Niederreiter & C. Xing, Symmetric polynomials and some good codes. Finite Fields and Their Applications 7, 142 – 148 (2001)
  22. C. Khare & S. Ling, Maps between Jacobians of Shimura curves and congruence kernels. Mathematische Annalen 319, 383 – 394 (2001)
  23. K.H. Leung, S. Ling & S.L. Ma, Construction of semi-regular relative difference sets. Finite Fields and Their Applications 7, 397 – 414 (2001)
  24. S. Ling & P. Solé, Duadic codes over Z2k. IEEE Transactions on Information Theory 47, 1581 – 1589 (2001)
  25. H. Chen, S. Ling & C. Xing, Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. IEEE Transactions on Information Theory 47, 2055 – 2058 (2001)
  26. S. Ling & P. Solé, Type II codes over F4 + uF4. European Journal of Combinatorics 22, 983 – 997 (2001)
  27. S. Ling & P. Solé, Duadic codes over F2 + uF2. Applicable Algebra in Engineering, Communication and Computing 12, 365 – 379 (2001)
  28. S. Ling & P. Solé, On the algebraic structure of quasi-cyclic codes I: finite fields. IEEE Transactions on Information Theory 47, 2751 – 2760 (2001) 
  29. K.H. Leung, S. Ling & C. Xing, New binary linear codes from algebraic curves. IEEE Transactions on Information Theory 48, 285 – 287 (2002)
  30. Y.M. Chee & S. Ling, Highly symmetric expanders. Finite Fields and Their Applications 8, 294 – 310 (2002)
  31. S. Ling & J.T. Blackford, Zp^{k+1}-linear codes. IEEE Transactions on Information Theory 48, 2592 – 2605 (2002)
  32. S. Ling & P. Solé, Good self-dual quasi-cyclic codes exist. IEEE Transactions on Information Theory 49, 1052 – 1053 (2003) 
  33. S. Ling & P. Solé, On the algebraic structure of quasi-cyclic codes II: chain rings. Designs, Codes and Cryptography 30, 113 – 130 (2003)
  34. S. Ling & P. Solé, Nonlinear p-ary sequences. Applicable Algebra in Engineering, Communication and Computing 14, 117 – 125 (2003) 
  35. K.H.D. Chua, A. Tyagi, S. Ling & S.H. Bok, Process-parameter-interface model for design management. Journal of Construction Engineering and Management, ASCE 129, 653 – 663 (2003)
  36. F.-W. Fu, S. Ling & C. Xing, New lower bounds and constructions for binary codes correcting asymmetric errors. IEEE Transactions on Information Theory 49, 3294 – 3299 (2003)
  37. K. Betsumiya, S. Ling & F. Nemenzo, Type II codes over F2^m + uF2^m. Discrete Mathematics 275, 43 – 65 (2004)
  38. S. Ling & C. Xing, Polyadic codes revisited. IEEE Transactions on Information Theory 50, 200 – 207 (2004)
  39. S. Ling, A family of group character codes. European Journal of Combinatorics 25, 579 – 590 (2004)
  40. J. Lahtonen, S. Ling, P. Solé & D. Zinoviev, Z8-Kerdock codes and pseudorandom binary sequences. J. Complexity 20, 318 – 330 (2004)
  41. Y. Tang & S. Ling, On Viterbi-like algorithms and their applications to Reed-Muller codes. J. Complexity 20, 438 – 457 (2004)
  42. S. Ling & F. Özbudak, An improvement on the bounds of Weil exponential sums over Galois rings with some applications. IEEE Transactions on Information Theory 50, 2529 – 2539 (2004)  
  43. F.-W. Fu, S. Ling & C. Xing, On the variance of average distance of subsets in the Hamming space. Discrete Applied Math 145, 465 – 478 (2005)  
  44. S. Ling & P. Solé, On the algebraic structure of quasi-cyclic codes III: generator theory. IEEE Transactions on Information Theory 51, 2692 – 2700 (2005)
  45. H. Chen, S. Ling & C. Xing, Quantum codes from concatenated algebraic-geometric codes. IEEE Transactions on Information Theory 51, 2915 – 2920 (2005)
  46. S.-T. Xia, F.-W. Fu, Y. Jiang & S. Ling, The probability of undetected error for binary constant weight codes. IEEE Transactions on Information Theory 51, 3364 – 3373 (2005)
  47. S. Ling, H. Stichtenoth & S. Yang, A class of Artin-Schreier towers with finite genus, Bull. Brazilian Math. Soc. 36, 393 – 401 (2005)
  48. S. Ling, F. Özbudak & C. Xing, An explicit class of codes with good parameters and their duals, Discrete Applied Math. 154, no. 2, 346 – 356 (2006)  
  49. S. Ling & F. Özbudak, Improved p-ary codes and sequence families from Galois rings of characteristic p2, SIAM J Discrete Math. 19, no. 4, 1011 – 1028 (2006)
  50. S. Ling, H. Niederreiter & P. Solé, On the algebraic structure of quasi-cyclic codes IV: repeated roots, Designs, Codes and Cryptography 38, no. 3, 337 – 361 (2006)
  51. S. Dougherty & S. Ling, Cyclic codes over Z4 of even length, Designs, Codes and Cryptography 39, no. 2, 127 – 153 (2006)
  52. Y. Tang, F.-W. Fu & S. Ling, On the reliability-order-based decoding algorithm for binary linear block codes, IEEE Transactions on Information Theory 52, no. 1, 328 – 336 (2006)
  53. K. Feng, S. Ling & C. Xing, Asymptotic bounds on quantum codes from algebraic geometry codes, IEEE Transactions on Information Theory 52, no. 3, 986 – 991 (2006)
  54. S. Ling & F. Özbudak, Aperiodic and odd correlations of some p-ary sequences from Galois rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A, no. 9, 2258 – 2263 (2006)
  55. S.-T. Xia, F.-W. Fu & S. Ling, A lower bound on the probability of undetected error for binary constant weight codes, IEEE Transactions on Information Theory 52, no. 9, 4235 – 4243 (2006)
  56. Y.M. Chee & S. Ling, Constructions for q-ary constant weight codes, IEEE Transactions on Information Theory 53, no. 1, 135 – 146 (2007)  
  57. Y.M. Chee, A.C.H. Ling, S. Ling & H. Shen, The PBD-closure of constant composition codes, IEEE Transactions on Information Theory 53, no. 8, 2685 – 2692 (2007)
  58. S. Ling & F. Özbudak, Constructions and bounds on linear error-block codes, Designs, Codes and Cryptography 45, 297 – 316 (2007)
  59. L. Pu, H. Shen, J. Ma & S. Ling, Cycle systems in the complete bipartite graph plus one factor, SIAM J Discrete Math. 21, no. 4, 1083 – 1092 (2007)
  60. Y.M. Chee & S. Ling, Improved lower bounds for constant GC-content DNA codes, IEEE Transactions on Information Theory 54, no. 1, 391 – 394 (2008)
  61. H. Chen, S. Ling & C. Xing, Access structures of elliptic secret sharing schemes, IEEE Transactions on Information Theory 54, no. 2, 850 – 852 (2008)   
  62. Y.M. Chee, S.H. Dau, A.C.H. Ling & S. Ling, The sizes of optimal q-ary codes of weight three and distance four: a complete solution, IEEE Transactions on Information Theory 54, no. 3, 1291 – 1295 (2008)
  63. S. Ling & F. Özbudak, Some constructions of (t,m,s)-nets with improved parameters, Finite Fields and Their Applications 14, 658 – 675 (2008)  
  64. H.M. Kiah, K.H. Leung & S. Ling, Cyclic codes over GR(pe, m) of length pk, Finite Fields and Their Applications 14, 834 – 846 (2008)
  65. C. Li, Q. Li & S. Ling, Properties and applications of preimage distributions of perfect nonlinear functions, IEEE Transactions on Information Theory 55, no. 1, 64 – 69 (2009)
  66. C. Li, S. Ling & L. Qu, On the covering structures of two classes of linear codes from perfect nonlinear functions, IEEE Transactions on Information Theory 55, no. 1, 70 – 82 (2009)    
  67. C. Li, Q. Li & S. Ling, On the constructions of constant-composition codes from perfect nonlinear functions, Science in China, to appear.
Papers in Proceedings of Conferences
  1. S. Ling, B.H. Seah, E.C. Tan, S.P., Tan Frequency assignment problems with various constraints. In: Proceedings of International Conference on Communication Systems 94, Singapore, pp. 1085 – 1089 (1994)
  2. K.Y. Lam, L.C.K. Hui & S. Ling, Generating secure elliptic curves for public key cryptosystems. In: Proceedings of Chinacrypt 96, eds. D.Y. Pei, R.J. Zhao and J.J. Zhou, pp. 60 – 64 (1996)
  3. K.Y. Lam, S. Ling & L.C.K. Hui, Efficient generation of elliptic curve cryptosystems. In: Proceedings of 2nd Annual International Computing and Combinatorics Conference, eds. J.Y. Cai and C.-K. Wong, pp. 411 – 416 (1996)
  4. S.K. Chua & S. Ling, A Rabin-type scheme based on y2 = x3 + bx2 mod n. In Computing and Combinatorics, Proceedings of 3rd Annual International Computing and Combinatorics Conference, T. Jiang & D.T. Lee eds, Springer, pp. 186 – 191 (1997)
  5. Y.M. Chee & S. Ling, Algebraic constructions of Ramanujan graphs and highly symmetric expanders. In: Proceedings of the Second Asian Mathematical Conference 1995, S Tangmanee & E Schulz eds, World Scientific, pp. 276 – 282 (1998) 
  6. D.R. Kohel, S. Ling & C. Xing, Explicit sequence expansions. In: Sequences and their Applications, Proceedings of International Conference on Sequences and their Applications (Singapore, 14 -- 17 Dec 1998), C. Ding, T. Helleseth and H. Niederreiter eds, Springer, pp. 308 – 317 (1999)
  7. C. Ding, D.R. Kohel & S. Ling, Counting the number of points on affine diagonal curves. In: Cryptography and Computational Number Theory, K.-Y. Lam, I. Shparlinski, H. Wang and C. Xing eds., Progress in Computer Science and Applied Logic 20, Birkhäuser Verlag, pp. 15 – 24 (2001)
  8. S. Ling & P. Solé, Decomposing quasi-cyclic codes. In: Proceedings of International Workshop on Coding and Cryptography 2001, D. Augot and C. Carlet eds., pp. 507 – 517 (2001)
  9. S. Ling, Duadic codes. In: Proceedings of 3rd Asian Mathematical Conference 2000, T. Sunada, P.W. Sy and Y. Lo eds., pp. 324 – 336 (2002)
  10. S. Ling, F. Özbudak & C. Xing, An explicit construction of a class of good codes and their duals. In: Proceedings of International Workshop on Coding and Cryptography 2003, D. Augot, P. Charpin and G. Kabatianski eds., pp. 299 – 306 (2003)
  11. S. Ling & P. Solé, Good self-dual quasi-cyclic codes over Fq, q odd. In: Proceedings of Coding, Cryptography and Combinatorics, K. Feng, H. Niederreiter and C. Xing, eds., Progress in Computer Science and Applied Logic 23, Birkhäuser Verlag, pp. 223 – 226 (2004)
  12. F.-W. Fu, S. Ling & C. Xing, Constructions of nonbinary codes correcting t-symmetric errors and detecting all unidirectional errors: magnitude error criterion. In: Proceedings of Coding, Cryptography and Combinatorics, K. Feng, H. Niederreiter and C. Xing, eds., Progress in Computer Science and Applied Logic 23, Birkhäuser Verlag, pp. 139 – 152 (2004)
  13. S. Ling & F. Özbudak, Improved p-ary codes and sequence families from Galois rings (Extended Abstract). In: Proceedings of Sequences and Their Applications 2004, pp. 79 – 83 (2004)
  14. S. Ling & F. Özbudak, Improved p-ary codes and sequence families from Galois rings (Full Paper). In: Sequences and Their Applications – SETA 2004, T. Helleseth, D. Sarwate, H.-Y. Song, et al eds., LNCS 3486, Springer, pp. 236 – 242 (2005)
  15. S. Ling & F. Özbudak, Improved bounds on Weil sums over Galois rings and homogeneous weights. In: Proceedings of Workshop on Coding and Cryptography 2005, pp. 445 – 453 (2005)
  16. S. Ling & F. Özbudak, On the aperiodic and odd correlations of some p-ary sequences from Galois rings. In: Proceedings of Second International Workshop on Sequence Design and its Applications – IWSDA 05, S. Matsufuji & W.H. Mow eds., pp. 21 – 23 (2005)
  17. S. Ling & F. Özbudak , Improved bounds on Weil sums over Galois rings and homogeneous weights. In: Coding and Cryptography – WCC 2005, Ø Ytrehus ed., Lecture Notes in Computer Science 3969, Springer, pp. 412 – 426 (2006)
  18. S.-T. Xia, F.-W. Fu & S. Ling, A lower bound on the probability of undetected error for binary constant weight codes. In: Proceedings of International Symposium on Information Theory – ISIT 2006, pp. 302 – 306 (2006)
  19. S. Contini, K. Matusiewicz, J. Pieprzyk, R. Steinfeld, J. Guo, S. Ling and H. Wang, Cryptanalysis of LASH. In: Fast Software Encryption 2008, K. Nyberg ed., Lecture Notes in Computer Science 5086, Springer, pp. 207 – 223 (2008)
  20. Y. Lu, H. Wang and S. Ling, Cryptanalysis of Rabbit. In: Information Security, Proceedings of 11th Information Security Conference 2008, T.-C. Wu, C.-L. Lei, V. Rijmen, D.-T. Lee, eds., Lecture Notes in Computer Science 5222, Springer, pp. 204 – 214 (2008)  
  21. Z. Zhang, M. Liu, Y.M. Chee, S. Ling and H. Wang, Strongly multiplicative and 3-multiplicative linear secret sharing schemes. In: Advances in Cryptology – Asiacrypt 2008, J. Pieprzyk ed., Lecture Notes in Computer Science 5350, Springer, pp. 19 – 36 (2008)
Book Chapters
  1. S. Ling, H. Wang & C. Xing, Cover-Free Families and Their Applications. In: Security in Distributed and Networking Systems, Yang Xiao and Yi Pan eds., World Scientific Publishing Co., 2007, pp. 75 – 98

Best viewed with Microsoft IE 6.0 and above