Yanxun Chang

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 30

Top Venues

Discret. Math.

Des. Codes Cryptogr.

IEEE Trans. Inf. Theory

CoRR

Publications

Chenya Zhao, Binwei Zhao, Yanxun Chang, Tao Feng, Xiaomiao Wang, Menglong Zhang
Cyclic relative difference families with block size four and their applications. J. Comb. Theory, Ser. A 206 (2024)
Mengzhen Zhao, Yanxun Chang
The weight distributions of some linear codes derived from Kloosterman sums. CoRR (2024)
Jian Li, Yanxun Chang
New Constructions of D2D Placement Delivery Arrays. IEEE Commun. Lett. 27 (1) (2023)
Liantao Lan, Yanxun Chang, Lidong Wang
The completion of optimal cyclic quaternary codes of weight 3 and distance 3. Des. Codes Cryptogr. 90 (4) (2022)
Yuxing Yang, Yanxun Chang, Lidong Wang
Kite-group divisible packings and coverings with any minimum leave and minimum excess. Adv. Math. Commun. 16 (4) (2022)
Jian Li, Yanxun Chang
Placement Delivery Arrays Based on Combinatorial Designs. IEEE Commun. Lett. 26 (2) (2022)
Xiangqian Li, Yanxun Chang, Zihong Tian
-large sets of Mendelsohn triple systems. Discret. Math. 344 (8) (2021)
Yueting Li, Yanxun Chang, Minquan Cheng, Tao Feng
Multi-value private information retrieval with colluding databases via trace functions. Inf. Sci. 543 (2021)
Shuangqing Liu, Yanxun Chang, Tao Feng
Parallel Multilevel Constructions for Constant Dimension Codes. IEEE Trans. Inf. Theory 66 (11) (2020)
Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley, Junling Zhou
New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. 90 (2020)
Yanxun Chang, Simone Costa, Tao Feng, Xiaomiao Wang
Strong difference families of special types. Discret. Math. 343 (4) (2020)
Bohua Zhu, Junling Zhou, Yanxun Chang
2-(v, 5; m) spontaneous emission error designs. Des. Codes Cryptogr. 88 (5) (2020)
Yueting Li, Yanxun Chang, Tao Feng
Triangle decompositions of λKv-λKw-λKu. Discret. Math. 343 (7) (2020)
Yanxun Chang, Hao Zheng, Junling Zhou
Existence of frame-derived H-designs. Des. Codes Cryptogr. 87 (6) (2019)
Shuangqing Liu, Yanxun Chang, Tao Feng
Constructions for Optimal Ferrers Diagram Rank-Metric Codes. IEEE Trans. Inf. Theory 65 (7) (2019)
Changyuan Wang, Yanxun Chang, Tao Feng
Optimal Multiply Constant-weight Codes from Generalized Howell Designs. Graphs Comb. 35 (3) (2019)
Liantao Lan, Yanxun Chang
Two-weight codes: Upper bounds and new optimal constructions. Discret. Math. 342 (11) (2019)
Yanxun Chang, Fengzhao Cheng, Junling Zhou
Partial geometric difference sets and partial geometric difference families. Discret. Math. 341 (9) (2018)
Liantao Lan, Yanxun Chang
Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six. Discret. Math. 341 (4) (2018)
Liantao Lan, Yanxun Chang, Lidong Wang
Constructions of cyclic quaternary constant-weight codes of weight three and distance four. Des. Codes Cryptogr. 86 (5) (2018)
Junling Zhou, Yanxun Chang
Further results on 3-spontaneous emission error designs. Discret. Math. 341 (11) (2018)
Suhui Dai, Yanxun Chang, Lidong Wang
w-cyclic holey group divisible designs and their application to three-dimensional optical orthogonal codes. Discret. Math. 340 (7) (2017)
Hao Zheng, Yanxun Chang, Junling Zhou
Large sets of Kirkman triple systems of prime power sizes. Des. Codes Cryptogr. 85 (3) (2017)
Yanxun Chang, Lijun Ji, Hao Zheng
). Discret. Math. 340 (5) (2017)
Junling Zhou, Yanxun Chang
Bounds and constructions of t-spontaneous emission error designs. Des. Codes Cryptogr. 85 (2) (2017)
Hao Zheng, Yanxun Chang, Junling Zhou
Direct constructions of large sets of Kirkman triple systems. Des. Codes Cryptogr. 83 (1) (2017)
Liantao Lan, Yanxun Chang, Lidong Wang
Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions. IEEE Trans. Inf. Theory 62 (11) (2016)
Xijuan Hu, Yanxun Chang, Tao Feng
Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess. Graphs Comb. 32 (4) (2016)
Rong Pan, Yanxun Chang
A note on difference matrices over non-cyclic finite abelian groups. Discret. Math. 339 (2) (2016)
Lidong Wang, Yanxun Chang
Determination of sizes of optimal three-dimensional optical orthogonal codes of weight three with the AM-OPP restriction. CoRR (2016)
Lidong Wang, Yanxun Chang
Combinatorial Constructions of Optimal Three-Dimensional Optical Orthogonal Codes. IEEE Trans. Inf. Theory 61 (1) (2015)
Tao Feng, Xiaomiao Wang, Yanxun Chang
Semi-cyclic holey group divisible designs with block size three. Des. Codes Cryptogr. 74 (2) (2015)
Rong Pan, Yanxun Chang
(m, n, 3, 1) Optical Orthogonal Signature Pattern Codes With Maximum Possible Size. IEEE Trans. Inf. Theory 61 (2) (2015)
Guizhi Zhang, Yanxun Chang, Tao Feng
The flower intersection problem for S(2, 4, v)'s. Discret. Math. (2014)
Yan Wu, Yanxun Chang
(3, K(3)4 - e, v). Ars Comb. 113 (2014)
Jianying Fang, Yanxun Chang
Mutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes. Des. Codes Cryptogr. 73 (3) (2014)
Junling Zhou, Yanxun Chang
A new result on Sylvester's problem. Discret. Math. 331 (2014)
Junling Zhou, Yanxun Chang
New large sets of resolvable Mendelsohn triple systems. Discret. Math. 328 (2014)
Junling Zhou, Yanxun Chang, Yinv Zhang
On the exact size of maximum impulse radio sequences with parameters (m, k, λ, k-1). Discret. Appl. Math. 171 (2014)
Jianying Fang, Junling Zhou, Yanxun Chang
Nonexistence of some quantum jump codes with specified parameters. Des. Codes Cryptogr. 73 (1) (2014)
Rong Pan, Yanxun Chang
. Discret. Math. 313 (11) (2013)
Xiaomiao Wang, Yanxun Chang, Tao Feng
Optimal 2-D (n×m, 3, 2, 1)-optical Orthogonal Codes. IEEE Trans. Inf. Theory 59 (1) (2013)
Junling Zhou, Yanxun Chang
Overlarge sets of Mendelsohn triple systems with resolvability. Discret. Math. 313 (4) (2013)
Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi
)(K4-e)-packings. Discret. Math. 313 (22) (2013)
Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi
)(K4-e)-designs. Electron. Notes Discret. Math. 40 (2013)
Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou
TBSs in some minimum coverings. Discret. Math. 313 (3) (2013)
Rong Pan, Yanxun Chang
Combinatorial constructions for maximum optical orthogonal signature pattern codes. Discret. Math. 313 (24) (2013)
Yanxun Chang, Junling Zhou
Large sets of Kirkman triple systems and related designs. J. Comb. Theory, Ser. A 120 (3) (2013)
Yanxun Chang, Junling Zhou, Giovanni Lo Faro, Antoinette Tripodi
On tight blocking set in minimum coverings. Electron. Notes Discret. Math. 40 (2013)
Yuemei Huang, Yanxun Chang
The sizes of optimal (n, 4, λ, 3) optical orthogonal codes. Discret. Math. 312 (21) (2012)
Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou
Overlarge sets of resolvable idempotent quasigroups. Discret. Math. 312 (8) (2012)
Yanxun Chang, Fan Yang, Junling Zhou
. Discret. Math. 312 (2) (2012)
Yuemei Huang, Yanxun Chang
Two classes of optimal two-dimensional OOCs. Des. Codes Cryptogr. 63 (3) (2012)
Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi
The fine triangle intersection problem for kite systems. Discret. Math. 312 (3) (2012)
Yannan Li, Yanxun Chang, Bingli Fan
The intersection numbers of KTSs with a common parallel class. Discret. Math. 312 (19) (2012)
Xiaomiao Wang, Yanxun Chang
Further results on optimal (v, 4, 2, 1)-OOCs. Discret. Math. 312 (2) (2012)
Yanxun Chang, Yeow Meng Chee, Junling Zhou
. Des. Codes Cryptogr. 60 (1) (2011)
Xiaomiao Wang, Yanxun Chang, Ruizhong Wei
having prescribed number of short orbits. Discret. Math. 311 (8-9) (2011)
Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi
-e-designs. Discret. Math. 311 (21) (2011)
Junling Zhou, Yanxun Chang, Zihong Tian
Large sets of resolvable idempotent Latin squares. Discret. Math. 311 (1) (2011)
Yanxun Chang, Xiao Wang
Determination of the Exact Value for Psi (m, k, k-1). IEEE Trans. Inf. Theory 57 (6) (2011)
Tao Feng, Yanxun Chang
Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With Lambda =2. IEEE Trans. Inf. Theory 57 (10) (2011)
Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi
Three types of edge-switchable kite systems. Ars Comb. 100 (2011)
Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi
The triangle intersection numbers of a pair of disjoint S(2, 4, v)s. Discret. Math. 310 (21) (2010)
Junling Zhou, Yanxun Chang
New results on large sets of Kirkman triple systems. Des. Codes Cryptogr. 55 (1) (2010)
Xiaomiao Wang, Yanxun Chang
Further results on (v, 4, 1)-perfect difference families. Discret. Math. 310 (13-14) (2010)
Yanxun Chang, Tao Feng, Giovanni Lo Faro
The triangle intersection problem for S(2, 4, v) designs. Discret. Math. 310 (22) (2010)
Yanxun Chang
Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems. Discret. Math. 309 (20) (2009)
Junling Zhou, Yanxun Chang
Existence of good large sets of Steiner triple systems. Discret. Math. 309 (12) (2009)
Frank E. Bennett, Nicole Zwicker, Yanxun Chang
Existence of r-fold perfect (v, K, 1)-Mendelsohn designs with K SUBSET OF OR EQUAL TO {4, 5, 6, 7}. Discret. Math. 309 (14) (2009)
Yanxun Chang, Xiao Wang
New upper bound for (m, k, lambda)-IRSs with lambda >= 2. IEEE Trans. Inf. Theory 55 (9) (2009)
Yunqing Xu, Yanxun Chang, Gennian Ge, Hantao Zhang
. Discret. Math. 308 (22) (2008)
Cui-Ling Fan, Jian-Guo Lei, Yanxun Chang
Constructions of Difference Systems of Sets and Disjoint Difference Families. IEEE Trans. Inf. Theory 54 (7) (2008)
Haiyan Wang, Yanxun Chang
. Ars Comb. 89 (2008)
Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi
. Discret. Math. 308 (2-3) (2008)
Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi
-e)-designs. Discret. Math. 308 (24) (2008)
Zhao Wang, Yanxun Chang
Further results on fine structures of three Latin squares. Australas. J Comb. 42 (2008)
Junling Zhou, Yanxun Chang, L. Ji
The spectrum for large sets of pure Mendelsohn triple systems. Discret. Math. 308 (10) (2008)
Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi
, lambda) for any lambda. Discret. Math. 308 (2-3) (2008)
Tao Feng, Yanxun Chang, Lijun Ji
Constructions for strictly cyclic 3-designs and applications to optimal OOCs with lambda=2. J. Comb. Theory, Ser. A 115 (8) (2008)
Jingjing Gao, Yanxun Chang
New upper bounds for impulse radio sequences. IEEE Trans. Inf. Theory 52 (5) (2006)
Yunqing Xu, Yanxun Chang
-self-orthogonal Latin squares. Discret. Math. 306 (1) (2006)
Haiyan Wang, Yanxun Chang
. Graphs Comb. 22 (4) (2006)
Yanxun Chang, Cunsheng Ding
Constructions of External Difference Families and Disjoint Difference Families. Des. Codes Cryptogr. 40 (2) (2006)
Tao Feng, Yanxun Chang
congruent 1 (mod 4). Des. Codes Cryptogr. 39 (1) (2006)
Xin Wang, Yanxun Chang
The spectrum for self-converse directed BIBDs with block size four. Ars Comb. 75 (2005)
Junling Zhou, Yanxun Chang
Product constructions for large sets of resolvable MTSs and DTSs. Australas. J Comb. 33 (2005)
Jing Zhang, Yanxun Chang
The spectrum of cyclic BSEC with block size three. Discret. Math. 305 (1-3) (2005)
Qiang Li, Yanxun Chang
Decomposition of lambda-fold complete graphs into a certain five-vertex graph. Australas. J Comb. 30 (2004)
Yunqing Xu, Yanxun Chang
On the spectrum of r-self-orthogonal Latin squares. Discret. Math. 279 (1-3) (2004)
Frank E. Bennett, Yanxun Chang, Gennian Ge, Malcolm Greig
}, 1)-PBDs. Discret. Math. 279 (1-3) (2004)
Siu Lun Ma, Yanxun Chang
A New Class of Optimal Optical Orthogonal Codes With Weight Five. IEEE Trans. Inf. Theory 50 (8) (2004)
Yanxun Chang, Jianxing Yin
Further results on optimal optical orthogonal codes with weight 4. Discret. Math. 279 (1-3) (2004)
Yanxun Chang, Ryoh Fuji-Hara, Ying Miao
Combinatorial constructions of optimal optical orthogonal codes with weight 4. IEEE Trans. Inf. Theory 49 (5) (2003)
Yanxun Chang, Giovanni Lo Faro
The existence of directed BIBDs. Discret. Math. 272 (2-3) (2003)
Xin Wang, Yanxun Chang
Self-Converse Directed BIBDs with Block Size Four. Graphs Comb. 19 (4) (2003)
Yanxun Chang, Ying Miao
Constructions for optimal optical orthogonal codes. Discret. Math. 261 (1-3) (2003)
Yanxun Chang
The spectra for two classes of graph designs. Ars Comb. 65 (2002)
Yanxun Chang, Giovanni Lo Faro
Intersection numbers of Latin squares with their own orthogonal mates. Australas. J Comb. 26 (2002)
Yanxun Chang, Ying Miao
General Constructions for Double Group Divisible Designs and Double Frames. Des. Codes Cryptogr. 26 (1-3) (2002)

Yanxun Chang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yanxun Chang