default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianxing Yin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j55]Chengmin Wang, Jie Yan, Jianxing Yin:
Resolvable generalized difference matrices: Existence and applications. Finite Fields Their Appl. 42: 39-56 (2016)- 2015
- [j54]Peipei Dai, Jianmin Wang, Jianxing Yin:
Two series of equitable symbol weight codes meeting the Plotkin bound. Des. Codes Cryptogr. 74(1): 15-29 (2015) - [j53]Xizhao Luo, Jianxing Yin, Fei Yue:
Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions. IEEE Trans. Inf. Theory 61(6): 3305-3315 (2015) - 2014
- [j52]Peipei Dai, Jianmin Wang, Jianxing Yin:
Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property. Des. Codes Cryptogr. 71(2): 315-330 (2014) - [j51]Ce Shi
, Jianxing Yin:
Existence of super-simple OA $$_{\lambda }(3, 5, v)^{\prime }$$ s. Des. Codes Cryptogr. 72(2): 369-380 (2014) - 2013
- [j50]Kun Wang, Jianxing Yin:
Further results on the existence of nested orthogonal arrays. Des. Codes Cryptogr. 67(2): 233-243 (2013) - [j49]Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, Jianxing Yin:
Maximum Distance Separable Codes for Symbol-Pair Read Channels. IEEE Trans. Inf. Theory 59(11): 7259-7267 (2013) - 2012
- [j48]Danjun Huang, Weifan Wang, Jianxing Yin:
A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Ars Comb. 107: 379-384 (2012) - [j47]Ce Shi, Yu Tang, Jianxing Yin:
The equivalence between optimal detecting arrays and super-simple OAs. Des. Codes Cryptogr. 62(2): 131-142 (2012) - [j46]Lijun Ji, Yang Li, Jianxing Yin:
Constructions of covering arrays of strength five. Des. Codes Cryptogr. 62(2): 199-208 (2012) - [i3]Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, Jianxing Yin:
Maximum Distance Separable Codes for Symbol-Pair Read Channels. CoRR abs/1211.1728 (2012) - 2011
- [j45]Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin:
List decodability at small radii. Des. Codes Cryptogr. 61(2): 151-166 (2011) - [j44]Jianxing Yin, Xiaoke Yang, Yang Li:
Some 20-regular CDP(5, 1;20u) and their applications. Finite Fields Their Appl. 17(4): 317-328 (2011) - [j43]Jianxing Yin, Jianmin Wang, Lijun Ji, Yang Li:
On the existence of orthogonal arrays OA(3, 5, 4n+2). J. Comb. Theory A 118(1): 270-276 (2011) - 2010
- [j42]Jianmin Wang, Xiuling Shan, Jianxing Yin:
On constructions for optimal two-dimensional optical orthogonal codes. Des. Codes Cryptogr. 54(1): 43-60 (2010) - [j41]Lijun Ji, Jianxing Yin:
Constructions of new orthogonal arrays and covering arrays of strength three. J. Comb. Theory A 117(3): 236-247 (2010) - [j40]Jianmin Wang, Jianxing Yin:
Two-dimensional optical orthogonal codes and semicyclic group divisible designs. IEEE Trans. Inf. Theory 56(5): 2177-2187 (2010) - [j39]Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin:
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. IEEE Trans. Inf. Theory 56(11): 5738-5746 (2010) - [i2]Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin:
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. CoRR abs/1008.1615 (2010) - [i1]Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin:
List Decodability at Small Radii. CoRR abs/1010.3312 (2010)
2000 – 2009
- 2009
- [j38]Jie Yan, Jianxing Yin:
A class of optimal constant composition codes from GDRPs. Des. Codes Cryptogr. 50(1): 61-76 (2009) - [j37]Yang Li, Lijun Ji, Jianxing Yin:
Covering arrays of strength 3 and 4 from holey difference matrices. Des. Codes Cryptogr. 50(3): 339-350 (2009) - [j36]Bin Wen, Jianmin Wang, Jianxing Yin:
Optimal grid holey packings with block size 3 and 4. Des. Codes Cryptogr. 52(1): 107-124 (2009) - [j35]Jianxing Yin, Chengmin Wang:
Kirkman covering designs with even-sized holes. Discret. Math. 309(6): 1422-1434 (2009) - 2008
- [j34]Jie Yan, Jianxing Yin:
Constructions of optimal GDRP(n, lambda;v)'s of type lambda1µm-1. Discret. Appl. Math. 156(14): 2666-2678 (2008) - [j33]Jianxing Yin, Jie Yan, Chengmin Wang:
Generalized balanced tournament designs and related codes. Des. Codes Cryptogr. 46(2): 211-230 (2008) - [j32]Cunsheng Ding, Jianxing Yin:
Constructions of almost difference families. Discret. Math. 308(21): 4941-4954 (2008) - [j31]Jianxing Yin, Xiuling Shan, Zihong Tian:
Constructions of partitioned difference families. Eur. J. Comb. 29(6): 1507-1519 (2008) - [j30]Cunsheng Ding, Jianxing Yin:
Sets of Optimal Frequency-Hopping Sequences. IEEE Trans. Inf. Theory 54(8): 3741-3745 (2008) - 2007
- [j29]Cunsheng Ding, Jianxing Yin:
Signal Sets From Functions With Optimum Nonlinearity. IEEE Trans. Commun. 55(5): 936-940 (2007) - 2006
- [j28]Cunsheng Ding, Jianxing Yin:
A Construction of Optimal Constant Composition Codes. Des. Codes Cryptogr. 40(2): 157-165 (2006) - [j27]Jianmin Wang, Jianxing Yin:
Constructions for Perfect 5-Deletion-Correcting Codes of Length 7. IEEE Trans. Inf. Theory 52(8): 3676-3685 (2006) - 2005
- [j26]Jianxing Yin:
Cyclic Difference Packing and Covering Arrays. Des. Codes Cryptogr. 37(2): 281-292 (2005) - [j25]Kai-Tai Fang, Yu Tang, Jianxing Yin:
Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs. J. Complex. 21(5): 757-771 (2005) - [j24]Cunsheng Ding, Jianxing Yin:
Algebraic constructions of constant composition codes. IEEE Trans. Inf. Theory 51(4): 1585-1589 (2005) - [j23]Cunsheng Ding, Jianxing Yin:
Combinatorial constructions of optimal constant-composition codes. IEEE Trans. Inf. Theory 51(10): 3671-3674 (2005) - 2004
- [j22]Kai-Tai Fang, Xuan Lu, Yu Tang, Jianxing Yin:
Constructions of uniform designs by using resolvable packings and coverings. Discret. Math. 274(1-3): 25-40 (2004) - [j21]Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin:
Preface. Discret. Math. 279(1-3): 1-2 (2004) - [j20]Yanxun Chang, Jianxing Yin:
Further results on optimal optical orthogonal codes with weight 4. Discret. Math. 279(1-3): 135-151 (2004) - 2003
- [j19]Nabil Shalaby, Jianxing Yin:
Maximum Complementary P3-Packings of Kv. Ars Comb. 66 (2003) - [j18]Jianxing Yin:
A new proof of a Colbourn-Rosa problem. Discret. Math. 261(1-3): 451-458 (2003) - [j17]Jianxing Yin:
Constructions of difference covering arrays. J. Comb. Theory A 104(2): 327-339 (2003) - 2002
- [j16]Jianxing Yin:
A survey on maximum distance holey packings. Discret. Appl. Math. 121(1-3): 279-294 (2002) - [j15]Nabil Shalaby, Jianmin Wang, Jianxing Yin:
Existence of Perfect 4-Deletion-Correcting Codes with Length Six. Des. Codes Cryptogr. 27(1-2): 145-156 (2002) - [j14]Jianxing Yin:
A General Construction for Optimal Cyclic Packing Designs. J. Comb. Theory A 97(2): 272-284 (2002) - 2001
- [j13]Jianxing Yin:
A Combinatorial Construction for Perfect Deletion-Correcting Codes. Des. Codes Cryptogr. 23(1): 99-110 (2001) - [j12]Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin:
Directed packing and covering designs with block size four. Discret. Math. 238(1-3): 3-17 (2001) - [j11]Ryoh Fuji-Hara, Ying Miao, Jianxing Yin:
Optimal (9v, 4, 1) Optical Orthogonal Codes. SIAM J. Discret. Math. 14(2): 256-266 (2001) - [j10]Gennian Ge, Jianxing Yin:
Constructions for optimal (v, 4, 1) optical orthogonal codes. IEEE Trans. Inf. Theory 47(7): 2998-3004 (2001)
1990 – 1999
- 1999
- [j9]Katherine Heinrich, Jianxing Yin:
On group divisible covering designs. Discret. Math. 202(1-3): 101-112 (1999) - 1998
- [j8]Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin:
Directed packings with block size 5. Australas. J Comb. 17: 235-256 (1998) - [j7]Charles J. Colbourn, Jianxing Yin:
On Directed Incomplete Transversal Designs with Block Size Five. Ars Comb. 50 (1998) - [j6]Frank E. Bennett, Jianxing Yin, Hantao Zhang, R. Julian R. Abel:
Perfect Mendelsohn Packing Designs with Block Size Five. Des. Codes Cryptogr. 14(1): 5-22 (1998) - [j5]Nabil Shalaby, Jianxing Yin:
Nested Optimal -Packings and -Coverings of Pairs with Triples. Des. Codes Cryptogr. 15(3): 271-278 (1998) - [j4]Jianxing Yin:
Some combinatorial constructions for optical orthogonal codes. Discret. Math. 185(1-3): 201-219 (1998) - 1997
- [j3]R. Julian R. Abel, Charles J. Colbourn, Jianxing Yin, Hantao Zhang:
Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. Des. Codes Cryptogr. 10(3): 275-307 (1997) - 1996
- [j2]Ahmed M. Assaf, A. Mahmoodi, Nabil Shalaby, Jianxing Yin:
Directed packings with block size 5 and odd v. Australas. J Comb. 13: 217-226 (1996) - 1995
- [j1]Nabil Shalaby, Jianxing Yin:
Directed Packings with Block Size 5 and Even v. Des. Codes Cryptogr. 6(2): 133-142 (1995)
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-06-10 20:30 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:
