He received the Ph.D. degree from Suzhou University, China, in 1995, in mathematics

His research interests include combinatorial design theory, coding theory, cryptography, and their interactions

2015.01-2019.12, NSFC, No. 11431003;

2013.01-2016.12, NSFC, No. 11271042;

2011.01-2013.12, NSFC, No. 61071221;

2009.01-2012.12, NSFC, No. 10831002;

2008.01-2010.12, NSFC, No. 10771013;

2004.01-2006.12, NSFC, No. 10371002;

2001.01-2003.12, NSFC, No. 10071002;

1998.01-2000.12, NSFC, No. 19701002.

Combinatorial Theory; Cryptography; Stream Cipher; Finite projective geometry

[1] X. Li, Y. Chang, and Z. Tian, The existence of $r$-large sets of Mendelsohn triple systems, Discrete Math., 344(2021) 112444.

[2] X. Li, Y. Chang, and J. Zhou, The existence of $r$-golf designs, J. Combinatorial Designs, Vol. 29(2021), 243-266.

[3] Y. Li, Y. Chang, M. Cheng and T. Feng, Multi-value information-theoretic private information retrieval with colluding databases, Information Sciences, 543(2021) 426-436.

[4] S. Liu, Y. Chang, and T. Feng, Parallel multilevel constructions for constant dimension codes, IEEE Trans. Inform. Theory, Vol. 66, Issue 11(2020), 6884-6897.

[5] Y. Chang, S. Costa, T. Feng, and X. Wang, Partitionable sets, almost partitionable sets and their applications, J. Combinatorial Designs, Vol. 28, No.11(2020), 783-813.

[6] Y. Chang, C. Liu, and Z. Su, The perimeter and area of the reduced spherical polygons with thickness $\frac {\pi}2$, Results Math. 75(2020) 135.

[7] Y. Chang, C. J. Colbourn, A. Gowty, D. Horsley, and J. Zhou, New bounds on maximum size of Sperner partition systems, European J. Combin., 90(2020) 103165.

[8] Y. Li, Y. Chang, and T. Feng, Triangle decompositions of $\lambda K_v-\lambda K_w-\lambda K_u$, Discrete Math., 343(2020) 111873.

[9] B. Zhu, J. Zhou and Y. Chang, $2$-$(v,5; m)$ Spontaneous emission error designs, Designs, Codes and Cryptography, Vol. 88, No. 5(2020), 951-970.

[10]Y. Chang, S. Costa, T. Feng, and X. Wang, Strong difference families with special types, Discrete Math., 343(2020) 111776.

[11]L. Lan and Y. Chang, Two-weight codes: upper bounds and new optimal constructions, Discrete Math., Vol. 342, No. 11(2019), 3098-3113.

[12]X. Li, Y. Chang, and J. Zhou, Group divisible $3$-designs with block size four and group type $1^{n}s^1$, J. Combinatorial Designs, Vol. 27(2019), 688-700.

[13]C. Wang, Y. Chang, and T. Feng, The asymptotic existence of frames with a pair of orthogonal resolutions, Science China Mathematics, Vol. 62, No. 9(2019), 1839-1850.

[14]S. Liu, Y. Chang, and T. Feng, Several classes of optimal Ferrers diagram rank-metric codes, Linear Algebra and its Applications, 581(2019), 128-144.

[15]S. Liu, Y. Chang, and T. Feng, Constructions for optimal Ferrers diagram rank-metric codes, IEEE Trans. Inform. Theory, Vol. 65, Issue 7(2019), 4115-4130.

[16]Y. Chang, H. Zheng and J. Zhou, Existence of frame-derived $H$-designs, Designs, Codes and Cryptography, Vol. 87(2019), 1415-1431.

[17]Y. Gao, Y. Chang, and T. Feng, Group divisible $(K_4-e)$-packings with any minimum leave, J. Combinatorial Designs, Vol. 26, Issue 7(2018), 315-343.

[18]J. Zhou and Y. Chang, Further results on $3$-spontaneous emission error designs, Discrete Math., 341 (2018), 3057-3074.

[19]Y. Chang, F. Cheng, and J. Zhou, Partial geometric difference sets and partial geometric difference families, Discrete Math., 341 (2018), 2490-2498.

[20]X. Zhang and Y. Chang, $p$-th Kazdan-Warner equation on graph in the negative case, J. Mathematical Analysis and Applications, 466(2018) 400-407.

[21]H. Zheng, Y. Chang, and J. Zhou, Existence of LS$^{+}(2^n4^1)$s, J. Combinatorial Designs, Vol. 26, No. 8(2018), 387-400.

[22]L. Lan and Y. Chang, Optimal cyclic quaternary constant-weight codes of weight three, J. Combinatorial Designs, 26(2018), 174-192.

[23]L. Lan, Y. Chang, and L. Wang, Constructions of cyclic quaternary constant-weight codes of weight three and distance four, Designs, Codes and Cryptography, Vol. 86(2018), 1063-1083.

[24]L. Lan and Y. Chang, Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six, Discrete Math., 341 (2018), 1010-1020.

[25]H. Zheng, Y. Chang, and J. Zhou, Large sets of Kirkman triple systems of prime power sizes, Designs, Codes and Cryptography, Vol. 85(2017), 411-423.

[26]L. Wang and Y. Chang, Determination of sizes of optimal three-dimensional optical orthogonal codes of weight three with the AM-OPP restriction, J. Combinatorial Designs, Vol. 25, Issue 7(2017), 310-334.

[27]J. Zhou and Y. Chang, Bounds and constructions of $t$-spontaneous emission error designs, Designs, Codes and Cryptography, Vol. 85(2017), 249-271.

[28]Y. Chang, B. Fan, T. Feng, D. F. Holt, and P. R. J. \"Osterg{\aa}rd, Classification of cyclic Steiner quadruple systems, J. Combinatorial Designs, Vol. 25, Issue 3(2017), 103-121.

[29]Y. Chang, L. Ji, and H. Zheng, A completion of LS$(2^n4^1)$, Discrete Math., 340(2017), 1080-1085.

[30]S. Dai, Y. Chang, and L. Wang, $w$-cyclic holey group divisible designs and their applications to three-dimensional optical orthogonal codes, Discrete Math., 340(2017), 1738-1748.

[31]H. Zheng, Y. Chang, and J. Zhou, Direct constructions of large sets of Kirkman triple systems}, Designs, Codes and Cryptography, Vol. 83, Issue 1(2017), 23-32.

[32]L. Lan, Y. Chang, and L. Wang, Cyclic constant-weight codes: upper bounds and new optimal constructions, IEEE Trans. Inform. Theory, Vol. 62, Issue 11(2016), 6328-6341.

[33]J. Zhou and Y. Chang, Bounds on the dimensions of $2$-spontaneous emission error designs, J. Combinatorial Designs, Vol. 24, No. 10(2016), 439-460.

[34]J. Zhou and Y. Chang, $3$-spontaneous emission error designs from PSL$(2,q)$ or PGL$(2,q)$, J. Combinatorial Designs, Vol. 24, No. 5(2016), 234-245.

[35]R. Pan and Y. Chang, A note on difference matrices over non-cyclic finite abelian groups, Discrete Math., Vol. 339, Issue 2(2016), 822-830.

[36]T. Feng, X. Wang, and Y. Chang, Semi-cyclic holey group divisible designs with block size three, Designs, Codes and Cryptography, Vol. 74, Issue 2(2015), 301-324.

[37]R. Pan and Y. Chang, $(m,n,3,1)$ optical orthogonal signature pattern codes with maximum possible size, IEEE Trans. Inform. Theory, Vol. 61, Issue 2(2015), 1139-1148.

[38]L. Wang and Y. Chang, Combinatorial constructions of optimal three-dimensional optical orthogonal codes, IEEE Trans. Inform. Theory, Vol. 61, Issue 1(2015), 671-687.

[39]J. Fang and Y. Chang, Mutually disjoint 5-designs and 5-spontaneous emission error designs from extremal ternary self-dual codes, J. Combinatorial Designs, Vol. 23, Issue 2(2015), 78-89.

[40]L. Wang and Y. Chang, Bounds and constructions on $(v,4,3,2)$-optical orthogonal codes, J. Combinatorial Designs, Vol. 22, Issue 11(2014), 453-472.

[41]R. Pan and Y. Chang, Further results on optimal $(m,n,4,1)$-optical orthogonal signature pattern codes (in Chinese), Sci Sin Math, Vol. 44, No. 11(2014), 1141-1152.

[42]J. Fang and Y. Chang, Mutually disjoint $t$-designs and $t$-SEEDs from extremal doubly-even self-dual codes, Designs, Codes and Cryptography, Vol. 73, Issue 3(2014), 769-780.

[43]J. Zhou and Y. Chang, A new result on Sylvester's problem}, Discrete Math., Vol. 331(2014), 15-19.

[44]J. Zhou and Y. Chang, New large sets of resolvable Mendelsohn triple systems, Discrete Math., Vol. 328, No. 1(2014), 27-35.

[45]J. Zhou, Y. Chang, and Y. Zhang, On the exact size of maximum impulse radio sequences with parameters $(m,k,\lambda,k-1)$, Discrete Applied Math., 171(2014), 122-136.

[46]J. Fang, J. Zhou, and Y. Chang, Nonexistence of some quantum jump codes with specified parameters, Designs, Codes and Cryptography, Vol. 73, Issue 1(2014), 223-235.

[47]G. Zhang, Y. Chang, and T. Feng, The flower intersection problem on $S(2,4,v)$'s, Discrete Math., 315-316(2014), 75-82.

[48]R. Pan and Y. Chang, Combinatorial constructions for maximum optical orthogonal signature pattern codes, Discrete Math., Vol. 313, No. 24(2013), 2918-2931.

[49]R. Pan and Y. Chang, Determination of the sizes of optimal $(m,n,k,\lambda,k-1)$-OOSPCs with $\lambda=k-1, k$, Discrete Math., Vol. 313, No. 12(2013), 1327-1337.

[50]Y. Chang and J. Zhou, Large sets of Kirkman triple systems and related designs, J. Combin. Theory, Series A Vol. 120, No. 3(2013) 649-670.

[51]X. Wang, Y. Chang, and T. Feng, Optimal $2$-D $(n\times m, 3, 2, 1)$-optical orthogonal codes, IEEE Trans. Inform. Theory, Vol. 59, No. 1(2013), 710-725.

[52]J. Zhou and Y. Chang, Overlarge sets of Mendelsohn triple systems with resolvability, Discrete Math., Vol. 313, No. 4(2013), 490-497.

[53]Y. Chang, G. Lo Faro, A. Tripodi, and J. Zhou, TBSs in some minimum coverings, Discrete Math., Vol. 313, No. 3(2013), 278-285.

[54]J. Zhou and Y. Chang, Further results on large sets of resolvable idempotent Latin squares, J. Combin. Designs, Vol. 20, Issue 9(2012), 399-407.

[55]J. Zhou and Y. Chang, Large sets of idempotent quasigroups with resolvability (in Chinese), Sci Sin Math, Vol. 42, No. 10(2012), 1037-1045.

[56]Y. Huang and Y. Chang, The sizes of optimal $(n,4,\lambda,3)$ optical orthogonal codes, Discrete Math. Vol. 312, No. 21(2012), 3128-3139.

[57]T. Feng, Z. Chai, and Y. Chang, Packings and coverings of complete $3$-uniform hypergraph (in Chinese), Sci Sin Math, Vol. 42, No. 6(2012), 619-633.

[58]Y. Li, Y. Chang, and B. Fan, The intersection numbers of KTSs with a common parallel class, Discrete Math., Vol. 312, Issue 19(2012), 2893-2904.

[59]Y. Huang and Y. Chang, Two classes of optimal two-dimensional OOCs, Designs, Codes and Cryptography, Vol. 63, No. 3(2012), 357-363.

[60]X. Wang and Y. Chang, Further results on optimal $(v,4,2,1)$-OOCs, Discrete Math. Vol. 312, No. 2(2012), 331-340.

[61]Y. Chang, F. Yang and J. Zhou, The existence spectrum for $(3,\lambda)$-GDDs of type $g^tu^1$, Discrete Math. Vol. 312, No.2(2012), 341-350.

[62]J. Zhou and Y. Chang, P$3$BD-closed sets, J. Combin. Designs, Vol. 19, No. 6(2011), 407-421.

[63]T. Feng and Y. Chang, Combinatorial constructions for optimal $2$-dimensional optical orthogonal codes with $\lambda=2$, IEEE Trans. Inform. Theory, Vol. 57, Issue 10(2011), 6796-6819.

[64]Y. Chang and X. Wang, Determination of the exact values for $\Psi(m, k, k-1)$, IEEE Trans. Inform. Theory, Vol. 57, Issue 6(2011), 3810-3814.

[65]Y. Chang, Y. M. Chee, and J. Zhou, A pair of disjoint $3$-GDDs with group-type $g^tu^1$, Designs, Codes and Cryptography, Vol. 60, No. 1(2011), 37-62.

[66]J. Zhou, Y. Chang, and Z. Tian, Large sets of resolvable idempotent Latin squares, Discrete Math., Vol. 311, No. 1(2011), 24-31.

[67]X. Wang, Y. Chang, and R. Wei, Existence of cyclic $(3,\lambda)$-GDD of type $g^v$ having prescribed number of short orbits, Discrite Math., Vol. 311, Nos. 8-9(2011), 663-675.

[68]T. Feng and Y. Chang, Constructions for cyclic $3$-designs and improved results on cyclic Steiner quadruple systems, J. Combin. Designs, Vol. 19, No. 3(2011), 178-201.

[69]J. Zhou and Y. Chang, New results on large sets of Kirkman triple systems, Designs, Codes and Cryptography, Vol. 55, No. 1(2010), 1-7.

[70]X. Wang and Y. Chang, The spectrum of cyclic $(3,\lambda)$-GDD of type $g^v$, Sci. China Math., Vol. 53, No. 2(2010), 431-446.

[71]X. Wang and Y. Chang, Further results on $(v,4,1)$ perfect difference families, Discrete Math. Vol. 310, Nos. 13-14(2010), 1995-2006.

[72]Y. Chang, T. Feng, G. Lo Faro, and A. Tripodi, The triangle intersection numbers of a pair of disjoint $S(2,4,v)$s, Discrete Math., Vol. 310, Issue 21(2010), 3007-3017.

[73]X. Wang and Y. Chang, The spectrum of $(gv,g,3,\lambda)$-DFs in $Z_{gv}$, Science in China Series A: Mathematics, Vol. 52, No. 5(2009), 1004-1016.

[74]J. Zhou and Y. Chang, Existence of good large sets of Steiner triple systems, Discrete Math., 309(2009), 3930-3935.

[75]Y. Chang, Transitive resolvable idempotent quasi-groups and large sets of resolvable Mendelsohn triple systems, Discrete Mathematics 309 (2009), 5926-5931.

[76]T. Feng, Y. Chang, and L. Ji, Constructions for rotational Steiner quadruple systems, J. Combin. Designs, Vol. 17(2009), 353-368.

[77]Y. Chang and X. Wang, New upper bound for $(m, k, \lambda)$-IRSs with $\lambda\geq 2$, IEEE Trans. Inform. Theory, Vol. 55, Issue 9(2009), 4274-4278.

[78]T. Feng, Y. Chang, and L. Ji, Constructions for strictly cyclic $3$-designs and applications to optimal OOCs with $\lambda=2$, J. Combin. Theory, Series A 115(2008), 1527-1551.

[79]Y. Chang, G. Lo Faro, and A. Tripodi, Tight blocking sets in some maximum packings of $\lambda K_n$, Discrete Math., Vol. 308(2008), 427-438.

[80]J. Zhou, Y. Chang, and L. Ji, The spectrum for large sets of pure Mendelsohn triple systems, Discrete Math., 308(2008), 1850-1863.

[81]C. Fan, J. Lei, and Y. Chang, Constructions of difference systems of sets and disjoint difference families}, IEEE Trans. Inform. Theory, Vol. 54, Issue 7(2008), 3195-3201.

[82]Y. Chang, The existence spectrum of golf designs, J. Combin. Designs, Vol. 15, No. 1(2007), 84-89.

[83]J. Zhang and Y. Chang, The spectrum of $BSA(v, 3, \lambda; \alpha)$ with $\alpha=2, 3$, J. Combin. Designs, Vol. 15, No. 1(2007), 61-76.

[84]Y. Chang, G. Lo Faro, and G. Nordo, The fine structures of three latin squares, J. Combin. Designs, Vol. 14, No. 2(2006), 85-110.

[85]T. Feng and Y. Chang, Existence of Z-cyclic $3$PTWh$(p)$ for prime $p\equiv 1\ ({ mod}\ 4)$, Designs, Codes and Cryptography, Vol. 39, No. 1(2006), 39-49.

[86]Y. Xu and Y. Chang, Existence of $r$-self-orthogonal Latin squares, Discrete Math., Vol. 306 (2006), 124-146.

[87]J. Gao and Y. Chang, New upper bounds for impulse radio sequences, IEEE Trans. Inform. Theory, Vol. 52, Issue 5(2006), 2255-2260.

[88]Y. Chang and C. Ding, Constructions of external difference families and disjoint difference families, Designs, Codes and Cryptography, Vol. 40, No. 2(2006), 167-185.

[89]J. Zhou, Y. Chang, and L. Ji, The spectrum for large sets of pure directed triple systems, Science in China, Ser. A, Chinese:Vol. 36, No. 7(2006), 764-788; English: Vol. 49(2006), 1103-1127.

[90]S. Ma and Y. Chang, Constructions of optimal optical orthogonal codes with weight five, J. Combin. Designs, Vol. 13, No. 1(2005), 54-69.

[91]J. Zhang and Y. Chang, The spectrum of cyclic BSA$(v,3,\lambda; \alpha)$ with $\alpha=2, 3$, J. Combin. Designs, Vol. 13, No.5(2005), 313-335.

[92]J. Zhang and Y. Chang, The spectrum of cyclic BSECs with block size three, Discrete Math., Vol. 305, Nos. 1-3(2005), 312-322.

[93]S. Ma and Y. Chang, A new class of optimal optical orthogonal codes with weight five, IEEE Trans. Inform. Theory, Vol. 50, Issue 8(2004), 1848-1850.

[94]Y. Chang and J. Yin, Further results on optimal optical orthogonal codes with weight $4$, Discrete Math., Vol. 279, Nos. 1-3(2004), 135-151.

[95]F. E. Bennett, Y. Chang, G. Ge, and M. Greig, Existence of $(v, \{5, w^*\}, 1)$-PBDs, Discrete Math., Vol. 279, Nos. 1-3(2004), 61-105.

[96]Y. Xu and Y. Chang, On the spectrum of $r$-self-orthogonal Latin squares, Discrete Math., Vol. 279, Nos. 1-3(2004), 479-498.

[97]Y. Chang, Some cyclic BIBDs with block size four, J. Combin. Designs, Vol. 12, No. 3(2004), 177-183.

[98]Y. Chang and L. Ji, Optimal $(4up, 5, 1)$ optical orthogonal codes, J. Combin. Designs, Vol. 12, No. 5(2004), 346-361.

[99]Y. Chang and Y. Miao, Constructions for optimal optical orthogonal codes, Discrete Math., 261(2003), 127-139.

[100]Y. Chang, R. Fuji-Hara, and Y. Miao, Combinatorial constructions of optimal optical orthogonal codes with weight $4$, IEEE Trans. Inform. Theory, Vol. 49, Issue 5 (2003), 1283-1292.

[101]Y. Chang and Y. Miao, General constructions for double group divisible designs and double frames, Designs, Codes and Cryptography, Vol. 26, Nos. 1-3 (2002), 155-168.

[102]D. Bryant, Y. Chang, C. A. Rodger, and R. Wei, Two dimensional balanced sampling plans excluding contiguous units, Communications in Statistics--Theory and Methods, Vol. 31, No. 8(2002), 1441-1454.

[103]J. Lei, Q. Kang, and Y. Chang, The spectrum for large set of disjoint incomplete Latin squares, Discrete Math., Vol. 238, Nos. 1-3(2001), 89-98.

[104]Y. Chang, The spectrum for large sets of idempotent quasigroups, J. Combin. Designs, Vol. 8(2000), 79-82.

[105]Y. Chang, A bound for Wilson's general theorem, Science in China, No.11(1999), 969-980; English: Sci. China Ser. A, Vol. 43, No. 2(2000), 128-140.

[106]Y. Chang and G. Lo Faro, Intersection numbers of Kirkman triple systems, J. Combin. Theory (A), Vol.86, No. 2 (1999), 348-361.

[107]F. E. Bennett, Y. Chang, J. Yin, and H. Zhang, Existence of HPMD with block size five, J. Combin. Designs Vol. 5(1997), 257-273.

[108]Y. Chang, A bound for Wilson's theorem (III), J. Combinatorial Designs, Vol. 4, No. 2(1996), 83-93.

[109]Y. Chang, A bound for Wilson's theorem (II), J. Combinatorial Designs, Vol. 4, No. 1(1996), 11-26.

[110]Y. Chang, A bound for Wilson's theorem (I), J. Combinatorial Designs, Vol. 3, No. 1(1995), 25-39.

[111]Q. Kang, J. Lei, and Y. Chang, The spectrum for large sets of disjoint Mendelsohn triple systems with any index, J. Combinatorial Designs, Vol. 2, No. 5(1994), 351-358.

[112]Q. Kang and Y. Chang, Further results about large sets of disjoint Mendelsohn triple systems, Discrete Math., 118, Nos. 1-3 (1993), 263-268.

[113]Q. Kang and Y. Chang, A completion of the spectrum for large sets of disjoint transitive triple systems, English: Journal Combin. Theory, Ser.A, Vol. 60, No. 2 (1992), 287-294.

[114]Y. Chang and Q. Kang, A representation of the non-zero elements in finite field, Science in China, Ser A, Chinese: No.11 (1990), 1146-1153; English: Vol. 34, No. 6 (1991), 641-649.