default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanxun Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j108]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: 105890 (2024)- [i2]Mengzhen Zhao, Yanxun Chang:
The weight distributions of some linear codes derived from Kloosterman sums. CoRR abs/2407.10051 (2024) - 2023
- [j107]Jian Li, Yanxun Chang:
New Constructions of D2D Placement Delivery Arrays. IEEE Commun. Lett. 27(1): 85-89 (2023) - 2022
- [j106]Yuxing Yang, Yanxun Chang, Lidong Wang:
Kite-group divisible packings and coverings with any minimum leave and minimum excess. Adv. Math. Commun. 16(4): 1121-1142 (2022) - [j105]Liantao Lan, Yanxun Chang, Lidong Wang:
The completion of optimal cyclic quaternary codes of weight 3 and distance 3. Des. Codes Cryptogr. 90(4): 851-862 (2022) - [j104]Jian Li, Yanxun Chang:
Placement Delivery Arrays Based on Combinatorial Designs. IEEE Commun. Lett. 26(2): 296-300 (2022) - 2021
- [j103]Xiangqian Li, Yanxun Chang, Zihong Tian:
The existence of r-large sets of Mendelsohn triple systems. Discret. Math. 344(8): 112444 (2021) - [j102]Yueting Li, Yanxun Chang, Minquan Cheng, Tao Feng:
Multi-value private information retrieval with colluding databases via trace functions. Inf. Sci. 543: 426-436 (2021) - 2020
- [j101]Bohua Zhu, Junling Zhou, Yanxun Chang:
2-(v, 5; m) spontaneous emission error designs. Des. Codes Cryptogr. 88(5): 951-970 (2020) - [j100]Yanxun Chang, Simone Costa, Tao Feng, Xiaomiao Wang:
Strong difference families of special types. Discret. Math. 343(4): 111776 (2020) - [j99]Yueting Li, Yanxun Chang, Tao Feng:
Triangle decompositions of λKv-λKw-λKu. Discret. Math. 343(7): 111873 (2020) - [j98]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: 103165 (2020) - [j97]Shuangqing Liu, Yanxun Chang, Tao Feng:
Parallel Multilevel Constructions for Constant Dimension Codes. IEEE Trans. Inf. Theory 66(11): 6884-6897 (2020)
2010 – 2019
- 2019
- [j96]Yanxun Chang, Hao Zheng, Junling Zhou:
Existence of frame-derived H-designs. Des. Codes Cryptogr. 87(6): 1415-1431 (2019) - [j95]Liantao Lan, Yanxun Chang:
Two-weight codes: Upper bounds and new optimal constructions. Discret. Math. 342(11): 3098-3113 (2019) - [j94]Changyuan Wang, Yanxun Chang, Tao Feng:
Optimal Multiply Constant-weight Codes from Generalized Howell Designs. Graphs Comb. 35(3): 611-632 (2019) - [j93]Shuangqing Liu, Yanxun Chang, Tao Feng:
Constructions for Optimal Ferrers Diagram Rank-Metric Codes. IEEE Trans. Inf. Theory 65(7): 4115-4130 (2019) - 2018
- [j92]Liantao Lan, Yanxun Chang, Lidong Wang:
Constructions of cyclic quaternary constant-weight codes of weight three and distance four. Des. Codes Cryptogr. 86(5): 1063-1083 (2018) - [j91]Liantao Lan, Yanxun Chang:
Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six. Discret. Math. 341(4): 1010-1020 (2018) - [j90]Yanxun Chang, Fengzhao Cheng, Junling Zhou:
Partial geometric difference sets and partial geometric difference families. Discret. Math. 341(9): 2490-2498 (2018) - [j89]Junling Zhou, Yanxun Chang:
Further results on 3-spontaneous emission error designs. Discret. Math. 341(11): 3057-3074 (2018) - 2017
- [j88]Hao Zheng, Yanxun Chang, Junling Zhou:
Direct constructions of large sets of Kirkman triple systems. Des. Codes Cryptogr. 83(1): 23-32 (2017) - [j87]Junling Zhou, Yanxun Chang:
Bounds and constructions of t-spontaneous emission error designs. Des. Codes Cryptogr. 85(2): 249-271 (2017) - [j86]Hao Zheng, Yanxun Chang, Junling Zhou:
Large sets of Kirkman triple systems of prime power sizes. Des. Codes Cryptogr. 85(3): 411-423 (2017) - [j85]Yanxun Chang, Lijun Ji, Hao Zheng:
A completion of LS(2n41). Discret. Math. 340(5): 1080-1085 (2017) - [j84]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): 1738-1748 (2017) - 2016
- [j83]Rong Pan, Yanxun Chang:
A note on difference matrices over non-cyclic finite abelian groups. Discret. Math. 339(2): 822-830 (2016) - [j82]Xijuan Hu, Yanxun Chang, Tao Feng:
Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess. Graphs Comb. 32(4): 1423-1446 (2016) - [j81]Liantao Lan, Yanxun Chang, Lidong Wang:
Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions. IEEE Trans. Inf. Theory 62(11): 6328-6341 (2016) - [i1]Lidong Wang, Yanxun Chang:
Determination of sizes of optimal three-dimensional optical orthogonal codes of weight three with the AM-OPP restriction. CoRR abs/1602.07944 (2016) - 2015
- [j80]Tao Feng, Xiaomiao Wang, Yanxun Chang:
Semi-cyclic holey group divisible designs with block size three. Des. Codes Cryptogr. 74(2): 301-324 (2015) - [j79]Lidong Wang, Yanxun Chang:
Combinatorial Constructions of Optimal Three-Dimensional Optical Orthogonal Codes. IEEE Trans. Inf. Theory 61(1): 671-687 (2015) - [j78]Rong Pan, Yanxun Chang:
(m, n, 3, 1) Optical Orthogonal Signature Pattern Codes With Maximum Possible Size. IEEE Trans. Inf. Theory 61(2): 1139-1148 (2015) - 2014
- [j77]Yan Wu, Yanxun Chang:
On the maximum packing problem of MPλ(3, K(3)4 - e, v). Ars Comb. 113: 361-375 (2014) - [j76]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: 122-136 (2014) - [j75]Jianying Fang, Junling Zhou, Yanxun Chang:
Nonexistence of some quantum jump codes with specified parameters. Des. Codes Cryptogr. 73(1): 223-235 (2014) - [j74]Jianying Fang, Yanxun Chang:
Mutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes. Des. Codes Cryptogr. 73(3): 769-780 (2014) - [j73]Guizhi Zhang, Yanxun Chang, Tao Feng:
The flower intersection problem for S(2, 4, v)'s. Discret. Math. 315-316: 75-82 (2014) - [j72]Junling Zhou, Yanxun Chang:
New large sets of resolvable Mendelsohn triple systems. Discret. Math. 328: 27-35 (2014) - [j71]Junling Zhou, Yanxun Chang:
A new result on Sylvester's problem. Discret. Math. 331: 15-19 (2014) - 2013
- [j70]Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou:
TBSs in some minimum coverings. Discret. Math. 313(3): 278-285 (2013) - [j69]Junling Zhou, Yanxun Chang:
Overlarge sets of Mendelsohn triple systems with resolvability. Discret. Math. 313(4): 490-497 (2013) - [j68]Rong Pan, Yanxun Chang:
Determination of the sizes of optimal (m, n, k, λ, k-1)-OOSPCs for λ=k-1, k. Discret. Math. 313(11): 1327-1337 (2013) - [j67]Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
Metamorphosis of simple twofold triple systems into maximum twofold (K4-e)(K4-e)-packings. Discret. Math. 313(22): 2538-2546 (2013) - [j66]Rong Pan, Yanxun Chang:
Combinatorial constructions for maximum optical orthogonal signature pattern codes. Discret. Math. 313(24): 2918-2931 (2013) - [j65]Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
Metamorphosis of simple twofold triple systems into twofold (K4-e)(K4-e)-designs. Electron. Notes Discret. Math. 40: 217-222 (2013) - [j64]Yanxun Chang, Junling Zhou, Giovanni Lo Faro, Antoinette Tripodi:
On tight blocking set in minimum coverings. Electron. Notes Discret. Math. 40: 365-370 (2013) - [j63]Yanxun Chang, Junling Zhou:
Large sets of Kirkman triple systems and related designs. J. Comb. Theory A 120(3): 649-670 (2013) - [j62]Xiaomiao Wang, Yanxun Chang, Tao Feng:
Optimal 2-D (n×m, 3, 2, 1)-optical Orthogonal Codes. IEEE Trans. Inf. Theory 59(1): 710-725 (2013) - 2012
- [j61]Yuemei Huang, Yanxun Chang:
Two classes of optimal two-dimensional OOCs. Des. Codes Cryptogr. 63(3): 357-363 (2012) - [j60]Xiaomiao Wang, Yanxun Chang:
Further results on optimal (v, 4, 2, 1)-OOCs. Discret. Math. 312(2): 331-340 (2012) - [j59]Yanxun Chang, Fan Yang, Junling Zhou:
The existence spectrum for (3, λ)-GDDs of type gtu1. Discret. Math. 312(2): 341-350 (2012) - [j58]Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
The fine triangle intersection problem for kite systems. Discret. Math. 312(3): 545-553 (2012) - [j57]Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou:
Overlarge sets of resolvable idempotent quasigroups. Discret. Math. 312(8): 1461-1467 (2012) - [j56]Yannan Li, Yanxun Chang, Bingli Fan:
The intersection numbers of KTSs with a common parallel class. Discret. Math. 312(19): 2893-2904 (2012) - [j55]Yuemei Huang, Yanxun Chang:
The sizes of optimal (n, 4, λ, 3) optical orthogonal codes. Discret. Math. 312(21): 3128-3139 (2012) - 2011
- [j54]Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi:
Three types of edge-switchable kite systems. Ars Comb. 100: 79-96 (2011) - [j53]Yanxun Chang, Yeow Meng Chee, Junling Zhou:
A pair of disjoint 3-GDDs of type gtu1. Des. Codes Cryptogr. 60(1): 37-62 (2011) - [j52]Junling Zhou, Yanxun Chang, Zihong Tian:
Large sets of resolvable idempotent Latin squares. Discret. Math. 311(1): 24-31 (2011) - [j51]Xiaomiao Wang, Yanxun Chang, Ruizhong Wei:
Existence of cyclic (3, λ)-GDD of type gv having prescribed number of short orbits. Discret. Math. 311(8-9): 663-675 (2011) - [j50]Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
The fine triangle intersection problem for K4-e-designs. Discret. Math. 311(21): 2442-2462 (2011) - [j49]Yanxun Chang, Xiao Wang:
Determination of the Exact Value for Psi (m, k, k-1). IEEE Trans. Inf. Theory 57(6): 3810-3814 (2011) - [j48]Tao Feng, Yanxun Chang:
Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With Lambda =2. IEEE Trans. Inf. Theory 57(10): 6796-6819 (2011) - 2010
- [j47]Junling Zhou, Yanxun Chang:
New results on large sets of Kirkman triple systems. Des. Codes Cryptogr. 55(1): 1-7 (2010) - [j46]Xiaomiao Wang, Yanxun Chang:
Further results on (v, 4, 1)-perfect difference families. Discret. Math. 310(13-14): 1995-2006 (2010) - [j45]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): 3007-3017 (2010) - [j44]Yanxun Chang, Tao Feng, Giovanni Lo Faro:
The triangle intersection problem for S(2, 4, v) designs. Discret. Math. 310(22): 3194-3205 (2010)
2000 – 2009
- 2009
- [j43]Junling Zhou, Yanxun Chang:
Existence of good large sets of Steiner triple systems. Discret. Math. 309(12): 3930-3935 (2009) - [j42]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): 4772-4783 (2009) - [j41]Yanxun Chang:
Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems. Discret. Math. 309(20): 5926-5931 (2009) - [j40]Yanxun Chang, Xiao Wang:
New upper bound for (m, k, lambda)-IRSs with lambda >= 2. IEEE Trans. Inf. Theory 55(9): 4274-4278 (2009) - 2008
- [j39]Zhao Wang, Yanxun Chang:
Further results on fine structures of three Latin squares. Australas. J Comb. 42: 241-252 (2008) - [j38]Haiyan Wang, Yanxun Chang:
(K3+e, lambda)-group divisible designs of type gtu1. Ars Comb. 89 (2008) - [j37]Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi:
Tight blocking sets in some maximum packings of lambdaKn. Discret. Math. 308(2-3): 427-438 (2008) - [j36]Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi:
Determining the spectrum of Meta(K4+e>K4, lambda) for any lambda. Discret. Math. 308(2-3): 439-456 (2008) - [j35]Junling Zhou, Yanxun Chang, L. Ji:
The spectrum for large sets of pure Mendelsohn triple systems. Discret. Math. 308(10): 1850-1863 (2008) - [j34]Yunqing Xu, Yanxun Chang, Gennian Ge, Hantao Zhang:
Frame self-orthogonal Mendelsohn triple systems of type hn. Discret. Math. 308(22): 5049-5063 (2008) - [j33]Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
Two types of switchable lambda-fold (K4-e)-designs. Discret. Math. 308(24): 6606-6625 (2008) - [j32]Tao Feng, Yanxun Chang, Lijun Ji:
Constructions for strictly cyclic 3-designs and applications to optimal OOCs with lambda=2. J. Comb. Theory A 115(8): 1527-1551 (2008) - [j31]Cui-Ling Fan, Jian-Guo Lei, Yanxun Chang:
Constructions of Difference Systems of Sets and Disjoint Difference Families. IEEE Trans. Inf. Theory 54(7): 3195-3201 (2008) - 2006
- [j30]Tao Feng, Yanxun Chang:
Existence of Z-cyclic 3PTWh (p) for any Prime p congruent 1 (mod 4). Des. Codes Cryptogr. 39(1): 39-49 (2006) - [j29]Yanxun Chang, Cunsheng Ding:
Constructions of External Difference Families and Disjoint Difference Families. Des. Codes Cryptogr. 40(2): 167-185 (2006) - [j28]Yunqing Xu, Yanxun Chang:
Existence of r-self-orthogonal Latin squares. Discret. Math. 306(1): 124-146 (2006) - [j27]Haiyan Wang, Yanxun Chang:
Kite-group Divisible Designs of Type gtu1. Graphs Comb. 22(4): 545-571 (2006) - [j26]Jingjing Gao, Yanxun Chang:
New upper bounds for impulse radio sequences. IEEE Trans. Inf. Theory 52(5): 2255-2260 (2006) - 2005
- [j25]Junling Zhou, Yanxun Chang:
Product constructions for large sets of resolvable MTSs and DTSs. Australas. J Comb. 33: 47-56 (2005) - [j24]Xin Wang, Yanxun Chang:
The spectrum for self-converse directed BIBDs with block size four. Ars Comb. 75 (2005) - [j23]Jing Zhang, Yanxun Chang:
The spectrum of cyclic BSEC with block size three. Discret. Math. 305(1-3): 312-322 (2005) - 2004
- [j22]Qiang Li, Yanxun Chang:
Decomposition of lambda-fold complete graphs into a certain five-vertex graph. Australas. J Comb. 30: 175-182 (2004) - [j21]Frank E. Bennett, Yanxun Chang, Gennian Ge, Malcolm Greig:
Existence of (v, {5, wstar}, 1)-PBDs. Discret. Math. 279(1-3): 61-105 (2004) - [j20]Yanxun Chang, Jianxing Yin:
Further results on optimal optical orthogonal codes with weight 4. Discret. Math. 279(1-3): 135-151 (2004) - [j19]Yunqing Xu, Yanxun Chang:
On the spectrum of r-self-orthogonal Latin squares. Discret. Math. 279(1-3): 479-498 (2004) - [j18]Siu Lun Ma, Yanxun Chang:
A New Class of Optimal Optical Orthogonal Codes With Weight Five. IEEE Trans. Inf. Theory 50(8): 1848-1850 (2004) - 2003
- [j17]Yanxun Chang, Ying Miao:
Constructions for optimal optical orthogonal codes. Discret. Math. 261(1-3): 127-139 (2003) - [j16]Yanxun Chang, Giovanni Lo Faro:
The existence of directed BIBDs. Discret. Math. 272(2-3): 155-169 (2003) - [j15]Xin Wang, Yanxun Chang:
Self-Converse Directed BIBDs with Block Size Four. Graphs Comb. 19(4): 567-575 (2003) - [j14]Yanxun Chang, Ryoh Fuji-Hara, Ying Miao:
Combinatorial constructions of optimal optical orthogonal codes with weight 4. IEEE Trans. Inf. Theory 49(5): 1283-1292 (2003) - 2002
- [j13]Yanxun Chang, Giovanni Lo Faro:
Intersection numbers of Latin squares with their own orthogonal mates. Australas. J Comb. 26: 283-304 (2002) - [j12]Yanxun Chang:
The spectra for two classes of graph designs. Ars Comb. 65 (2002) - [j11]Yanxun Chang, Ying Miao:
General Constructions for Double Group Divisible Designs and Double Frames. Des. Codes Cryptogr. 26(1-3): 155-168 (2002) - 2001
- [j10]Jianguo Lei, Qingde Kang, Yanxun Chang:
The spectrum for large set of disjoint incomplete Latin squares. Discret. Math. 238(1-3): 89-98 (2001) - [j9]Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu:
The integral sum number of complete bipartite graphs Kr, s. Discret. Math. 239(1-3): 137-146 (2001) - 2000
- [j8]Yanxun Chang:
The existence of resolvable BIBD with k even and lambda=1. Discret. Math. 218(1-3): 9-23 (2000) - [j7]Yanxun Chang, Giovanni Lo Faro:
Existence of DBIBDs with block size not divided by four. Discret. Math. 222(1-3): 27-40 (2000)
1990 – 1999
- 1999
- [j6]Yanxun Chang, Gennian Ge:
Some new large sets of KTS(v). Ars Comb. 51 (1999) - [j5]Yanxun Chang, Giovanni Lo Faro:
Intersection Numbers of Kirkman Triple Systems. J. Comb. Theory A 86(2): 348-361 (1999) - 1997
- [j4]Yanxun Chang:
A construction of holey perfect Mendelsohn designs. Ars Comb. 47 (1997) - 1996
- [j3]Yanxun Chang, Guihua Yang, Qingde Kang:
The spectrum of self-converse MTS. Ars Comb. 44 (1996) - 1993
- [j2]Qingde Kang, Yanxun Chang:
Further results about large sets of disjoint Mendelsohn triple systems. Discret. Math. 118(1-3): 263-268 (1993) - 1992
- [j1]Qingde Kang, Yanxun Chang:
A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems. J. Comb. Theory A 60(2): 287-294 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
