A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems. - Qingde Kang; Yanxun Chang (J. Comb. Theory A, 1992)

Further results about large sets of disjoint Mendelsohn triple systems. - Qingde Kang; Yanxun Chang (Discret. Math., 1993)

The spectrum of self-converse MTS. - Yanxun Chang; Guihua Yang; Qingde Kang (Ars Comb., 1996)

A construction of holey perfect Mendelsohn designs. - Yanxun Chang (Ars Comb., 1997)

Some new large sets of KTS(v). - Yanxun Chang; Gennian Ge (Ars Comb., 1999)

Intersection Numbers of Kirkman Triple Systems. - Yanxun Chang; Giovanni Lo Faro (J. Comb. Theory A, 1999)

The existence of resolvable BIBD with k even and lambda=1. - Yanxun Chang (Discret. Math., 2000)

Existence of DBIBDs with block size not divided by four. - Yanxun Chang; Giovanni Lo Faro (Discret. Math., 2000)

The integral sum number of complete bipartite graphs Kr, s. - Wenjie He; Yufa Shen; Lixin Wang; Yanxun Chang; Qingde Kang; Xinkai Yu (Discret. Math., 2001)

The spectrum for large set of disjoint incomplete Latin squares. - Jianguo Lei; Qingde Kang; Yanxun Chang (Discret. Math., 2001)

Intersection numbers of Latin squares with their own orthogonal mates. - Yanxun Chang; Giovanni Lo Faro (Australas. J Comb., 2002)

The spectra for two classes of graph designs. - Yanxun Chang (Ars Comb., 2002)

General Constructions for Double Group Divisible Designs and Double Frames. - Yanxun Chang; Ying Miao 001 (Des. Codes Cryptogr., 2002)

The existence of directed BIBDs. - Yanxun Chang; Giovanni Lo Faro (Discret. Math., 2003)

Constructions for optimal optical orthogonal codes. - Yanxun Chang; Ying Miao 001 (Discret. Math., 2003)

Self-Converse Directed BIBDs with Block Size Four. - Xin Wang; Yanxun Chang (Graphs Comb., 2003)

Combinatorial constructions of optimal optical orthogonal codes with weight 4. - Yanxun Chang; Ryoh Fuji-Hara; Ying Miao 001 (IEEE Trans. Inf. Theory, 2003)

Decomposition of lambda-fold complete graphs into a certain five-vertex graph. - Qiang Li; Yanxun Chang (Australas. J Comb., 2004)

Existence of (v, {5, wstar}, 1)-PBDs. - Frank E. Bennett; Yanxun Chang; Gennian Ge; Malcolm Greig (Discret. Math., 2004)

Further results on optimal optical orthogonal codes with weight 4. - Yanxun Chang; Jianxing Yin (Discret. Math., 2004)

On the spectrum of r-self-orthogonal Latin squares. - Yunqing Xu; Yanxun Chang (Discret. Math., 2004)

A New Class of Optimal Optical Orthogonal Codes With Weight Five. - Siu Lun Ma; Yanxun Chang (IEEE Trans. Inf. Theory, 2004)

Product constructions for large sets of resolvable MTSs and DTSs. - Junling Zhou; Yanxun Chang (Australas. J Comb., 2005)

The spectrum for self-converse directed BIBDs with block size four. - Xin Wang; Yanxun Chang (Ars Comb., 2005)

The spectrum of cyclic BSEC with block size three. - Jing Zhang; Yanxun Chang (Discret. Math., 2005)

Constructions of External Difference Families and Disjoint Difference Families. - Yanxun Chang; Cunsheng Ding (Des. Codes Cryptogr., 2006)

Existence of Z-cyclic 3PTWh (p) for any Prime p congruent 1 (mod 4). - Tao Feng 002; Yanxun Chang (Des. Codes Cryptogr., 2006)

Existence of r-self-orthogonal Latin squares. - Yunqing Xu; Yanxun Chang (Discret. Math., 2006)

Kite-group Divisible Designs of Type gtu1. - Haiyan Wang; Yanxun Chang (Graphs Comb., 2006)

New upper bounds for impulse radio sequences. - Jingjing Gao; Yanxun Chang (IEEE Trans. Inf. Theory, 2006)

Further results on fine structures of three Latin squares. - Zhao Wang; Yanxun Chang (Australas. J Comb., 2008)

(K3+e, lambda)-group divisible designs of type gtu1. - Haiyan Wang; Yanxun Chang (Ars Comb., 2008)

Two types of switchable lambda-fold (K4-e)-designs. - Yanxun Chang; Tao Feng 002; Giovanni Lo Faro; Antoinette Tripodi (Discret. Math., 2008)

Tight blocking sets in some maximum packings of lambdaKn. - Yanxun Chang; Giovanni Lo Faro; Antoinette Tripodi (Discret. Math., 2008)

Determining the spectrum of Meta(K4+e>K4, lambda) for any lambda. - Yanxun Chang; Giovanni Lo Faro; Antoinette Tripodi (Discret. Math., 2008)

Frame self-orthogonal Mendelsohn triple systems of type hn. - Yunqing Xu; Yanxun Chang; Gennian Ge; Hantao Zhang 001 (Discret. Math., 2008)

The spectrum for large sets of pure Mendelsohn triple systems. - Junling Zhou; Yanxun Chang; L. Ji (Discret. Math., 2008)

Constructions for strictly cyclic 3-designs and applications to optimal OOCs with lambda=2. - Tao Feng 002; Yanxun Chang; Lijun Ji (J. Comb. Theory A, 2008)

Constructions of Difference Systems of Sets and Disjoint Difference Families. - Cui-Ling Fan; Jian-Guo Lei; Yanxun Chang (IEEE Trans. Inf. Theory, 2008)

Existence of r-fold perfect (v, K, 1)-Mendelsohn designs with K SUBSET OF OR EQUAL TO {4, 5, 6, 7}. - Frank E. Bennett; Nicole Zwicker; Yanxun Chang (Discret. Math., 2009)

Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems. - Yanxun Chang (Discret. Math., 2009)

Existence of good large sets of Steiner triple systems. - Junling Zhou; Yanxun Chang (Discret. Math., 2009)

New upper bound for (m, k, lambda)-IRSs with lambda >= 2. - Yanxun Chang; Xiao Wang (IEEE Trans. Inf. Theory, 2009)

New results on large sets of Kirkman triple systems. - Junling Zhou; Yanxun Chang (Des. Codes Cryptogr., 2010)

The triangle intersection problem for S(2, 4, v) designs. - Yanxun Chang; Tao Feng 002; Giovanni Lo Faro (Discret. Math., 2010)

The triangle intersection numbers of a pair of disjoint S(2, 4, v)s. - Yanxun Chang; Tao Feng 002; Giovanni Lo Faro; Antoinette Tripodi (Discret. Math., 2010)

Further results on (v, 4, 1)-perfect difference families. - Xiaomiao Wang; Yanxun Chang (Discret. Math., 2010)

Three types of edge-switchable kite systems. - Yanxun Chang; Giovanni Lo Faro; Antoinette Tripodi (Ars Comb., 2011)

A pair of disjoint 3-GDDs of type gtu1. - Yanxun Chang; Yeow Meng Chee; Junling Zhou (Des. Codes Cryptogr., 2011)

The fine triangle intersection problem for K4-e-designs. - Yanxun Chang; Tao Feng 002; Giovanni Lo Faro; Antoinette Tripodi (Discret. Math., 2011)

Existence of cyclic (3, λ)-GDD of type gv having prescribed number of short orbits. - Xiaomiao Wang; Yanxun Chang; Ruizhong Wei (Discret. Math., 2011)

Large sets of resolvable idempotent Latin squares. - Junling Zhou; Yanxun Chang; Zihong Tian (Discret. Math., 2011)

Determination of the Exact Value for Psi (m, k, k-1). - Yanxun Chang; Xiao Wang (IEEE Trans. Inf. Theory, 2011)

Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With Lambda =2. - Tao Feng 002; Yanxun Chang (IEEE Trans. Inf. Theory, 2011)

Two classes of optimal two-dimensional OOCs. - Yuemei Huang; Yanxun Chang (Des. Codes Cryptogr., 2012)

The fine triangle intersection problem for kite systems. - Yanxun Chang; Tao Feng 002; Giovanni Lo Faro; Antoinette Tripodi (Discret. Math., 2012)

Overlarge sets of resolvable idempotent quasigroups. - Yanxun Chang; Giovanni Lo Faro; Antoinette Tripodi; Junling Zhou (Discret. Math., 2012)

The existence spectrum for (3, λ)-GDDs of type gtu1. - Yanxun Chang; Fan Yang; Junling Zhou (Discret. Math., 2012)

The sizes of optimal (n, 4, λ, 3) optical orthogonal codes. - Yuemei Huang; Yanxun Chang (Discret. Math., 2012)

The intersection numbers of KTSs with a common parallel class. - Yannan Li; Yanxun Chang; Bingli Fan (Discret. Math., 2012)

Further results on optimal (v, 4, 2, 1)-OOCs. - Xiaomiao Wang; Yanxun Chang (Discret. Math., 2012)

Metamorphosis of simple twofold triple systems into maximum twofold (K4-e)(K4-e)-packings. - Yanxun Chang; Tao Feng 002; Giovanni Lo Faro; Antoinette Tripodi (Discret. Math., 2013)

TBSs in some minimum coverings. - Yanxun Chang; Giovanni Lo Faro; Antoinette Tripodi; Junling Zhou (Discret. Math., 2013)

Determination of the sizes of optimal (m, n, k, λ, k-1)-OOSPCs for λ=k-1, k. - Rong Pan; Yanxun Chang (Discret. Math., 2013)

Combinatorial constructions for maximum optical orthogonal signature pattern codes. - Rong Pan; Yanxun Chang (Discret. Math., 2013)

Overlarge sets of Mendelsohn triple systems with resolvability. - Junling Zhou; Yanxun Chang (Discret. Math., 2013)

Metamorphosis of simple twofold triple systems into twofold (K4-e)(K4-e)-designs. - Yanxun Chang; Tao Feng 002; Giovanni Lo Faro; Antoinette Tripodi (Electron. Notes Discret. Math., 2013)

On tight blocking set in minimum coverings. - Yanxun Chang; Junling Zhou; Giovanni Lo Faro; Antoinette Tripodi (Electron. Notes Discret. Math., 2013)

Large sets of Kirkman triple systems and related designs. - Yanxun Chang; Junling Zhou (J. Comb. Theory A, 2013)

Optimal 2-D (n×m, 3, 2, 1)-optical Orthogonal Codes. - Xiaomiao Wang; Yanxun Chang; Tao Feng 002 (IEEE Trans. Inf. Theory, 2013)

On the maximum packing problem of MPλ(3, K(3)4 - e, v). - Yan Wu; Yanxun Chang (Ars Comb., 2014)

On the exact size of maximum impulse radio sequences with parameters (m, k, λ, k-1). - Junling Zhou; Yanxun Chang; Yinv Zhang (Discret. Appl. Math., 2014)

Mutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes. - Jianying Fang; Yanxun Chang (Des. Codes Cryptogr., 2014)

Nonexistence of some quantum jump codes with specified parameters. - Jianying Fang; Junling Zhou; Yanxun Chang (Des. Codes Cryptogr., 2014)

The flower intersection problem for S(2, 4, v)'s. - Guizhi Zhang; Yanxun Chang; Tao Feng 002 (Discret. Math., 2014)

New large sets of resolvable Mendelsohn triple systems. - Junling Zhou; Yanxun Chang (Discret. Math., 2014)

A new result on Sylvester's problem. - Junling Zhou; Yanxun Chang (Discret. Math., 2014)

Semi-cyclic holey group divisible designs with block size three. - Tao Feng 002; Xiaomiao Wang; Yanxun Chang (Des. Codes Cryptogr., 2015)

(m, n, 3, 1) Optical Orthogonal Signature Pattern Codes With Maximum Possible Size. - Rong Pan; Yanxun Chang (IEEE Trans. Inf. Theory, 2015)

Combinatorial Constructions of Optimal Three-Dimensional Optical Orthogonal Codes. - Lidong Wang; Yanxun Chang (IEEE Trans. Inf. Theory, 2015)

Determination of sizes of optimal three-dimensional optical orthogonal codes of weight three with the AM-OPP restriction. - Lidong Wang; Yanxun Chang (CoRR, 2016)

A note on difference matrices over non-cyclic finite abelian groups. - Rong Pan; Yanxun Chang (Discret. Math., 2016)

Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess. - Xijuan Hu; Yanxun Chang; Tao Feng 002 (Graphs Comb., 2016)

Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions. - Liantao Lan; Yanxun Chang; Lidong Wang (IEEE Trans. Inf. Theory, 2016)

Direct constructions of large sets of Kirkman triple systems. - Hao Zheng; Yanxun Chang; Junling Zhou (Des. Codes Cryptogr., 2017)

Large sets of Kirkman triple systems of prime power sizes. - Hao Zheng; Yanxun Chang; Junling Zhou (Des. Codes Cryptogr., 2017)

Bounds and constructions of t-spontaneous emission error designs. - Junling Zhou; Yanxun Chang (Des. Codes Cryptogr., 2017)

A completion of LS(2n41). - Yanxun Chang; Lijun Ji; Hao Zheng (Discret. Math., 2017)

w-cyclic holey group divisible designs and their application to three-dimensional optical orthogonal codes. - Suhui Dai; Yanxun Chang; Lidong Wang (Discret. Math., 2017)

Constructions of cyclic quaternary constant-weight codes of weight three and distance four. - Liantao Lan; Yanxun Chang; Lidong Wang (Des. Codes Cryptogr., 2018)

Partial geometric difference sets and partial geometric difference families. - Yanxun Chang; Fengzhao Cheng; Junling Zhou (Discret. Math., 2018)

Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six. - Liantao Lan; Yanxun Chang (Discret. Math., 2018)

Further results on 3-spontaneous emission error designs. - Junling Zhou; Yanxun Chang (Discret. Math., 2018)

Existence of frame-derived H-designs. - Yanxun Chang; Hao Zheng; Junling Zhou (Des. Codes Cryptogr., 2019)

Two-weight codes: Upper bounds and new optimal constructions. - Liantao Lan; Yanxun Chang (Discret. Math., 2019)

Optimal Multiply Constant-weight Codes from Generalized Howell Designs. - Changyuan Wang; Yanxun Chang; Tao Feng 002 (Graphs Comb., 2019)

Constructions for Optimal Ferrers Diagram Rank-Metric Codes. - Shuangqing Liu; Yanxun Chang; Tao Feng 002 (IEEE Trans. Inf. Theory, 2019)

2-(v, 5; m) spontaneous emission error designs. - Bohua Zhu; Junling Zhou; Yanxun Chang (Des. Codes Cryptogr., 2020)

Strong difference families of special types. - Yanxun Chang; Simone Costa; Tao Feng 002; Xiaomiao Wang (Discret. Math., 2020)

Triangle decompositions of λKv-λKw-λKu. - Yueting Li; Yanxun Chang; Tao Feng 002 (Discret. Math., 2020)

New bounds on the maximum size of Sperner partition systems. - Yanxun Chang; Charles J. Colbourn; Adam Gowty; Daniel Horsley; Junling Zhou (Eur. J. Comb., 2020)

Parallel Multilevel Constructions for Constant Dimension Codes. - Shuangqing Liu; Yanxun Chang; Tao Feng 002 (IEEE Trans. Inf. Theory, 2020)

The existence of r-large sets of Mendelsohn triple systems. - Xiangqian Li; Yanxun Chang; Zihong Tian (Discret. Math., 2021)

Multi-value private information retrieval with colluding databases via trace functions. - Yueting Li; Yanxun Chang; Minquan Cheng; Tao Feng 002 (Inf. Sci., 2021)

Kite-group divisible packings and coverings with any minimum leave and minimum excess. - Yuxing Yang; Yanxun Chang; Lidong Wang (Adv. Math. Commun., 2022)

The completion of optimal cyclic quaternary codes of weight 3 and distance 3. - Liantao Lan; Yanxun Chang; Lidong Wang (Des. Codes Cryptogr., 2022)

Placement Delivery Arrays Based on Combinatorial Designs. - Jian Li; Yanxun Chang (IEEE Commun. Lett., 2022)

New Constructions of D2D Placement Delivery Arrays. - Jian Li; Yanxun Chang (IEEE Commun. Lett., 2023)

The weight distributions of some linear codes derived from Kloosterman sums. - Mengzhen Zhao; Yanxun Chang (CoRR, 2024)

Cyclic relative difference families with block size four and their applications. - Chenya Zhao; Binwei Zhao; Yanxun Chang; Tao Feng 002; Xiaomiao Wang; Menglong Zhang (J. Comb. Theory, Ser. A, 2024)

The Existence of Optimal (v,4,1) Optical Orthogonal Codes Achieving the Johnson Bound. - Chenya Zhao; Yanxun Chang; Tao Feng 002 (IEEE Trans. Inf. Theory, 2024)

Cyclic balanced sampling plans avoiding adjacent units with block size four. - Zian Zhang; Yanxun Chang; Tao Feng 002 (Discret. Math., 2025)

Cross-modal Prompt-Driven Network for low-resource vision-to-language generation. - Yuena Jiang; Yanxun Chang (Eng. Appl. Artif. Intell., 2025)

Bounds and constructions of optimal symbol-pair codes with constant pair-weight. - Mengzhen Zhao; Yanxun Chang (Des. Codes Cryptogr., 2025)