We stand with Ukraine  

Jianmin Wang

Affiliations:
  • Suzhou University, Department of Mathematics, China


According to our database1, Jianmin Wang authored at least 9 papers between 2002 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Two series of equitable symbol weight codes meeting the Plotkin bound.
[BibTeX]
[DOI]
Peipei Dai
,
Jianmin Wang
,
Jianxing Yin
Des. Codes Cryptogr., 2015

2014
Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property.
[BibTeX]
[DOI]
Peipei Dai
,
Jianmin Wang
,
Jianxing Yin
Des. Codes Cryptogr., 2014

2012
Semicyclic 4-GDDs and related two-dimensional optical orthogonal codes.
[BibTeX]
[DOI]
Kun Wang
,
Jianmin Wang
Des. Codes Cryptogr., 2012

2011
On the existence of orthogonal arrays OA(3, 5, 4n+2).
[BibTeX]
[DOI]
Jianxing Yin
,
Jianmin Wang
,
Lijun Ji
,
Yang Li
J. Comb. Theory, Ser. A, 2011

2010
Two-dimensional optical orthogonal codes and semicyclic group divisible designs.
[BibTeX]
[DOI]
Jianmin Wang
,
Jianxing Yin
IEEE Trans. Inf. Theory, 2010

On constructions for optimal two-dimensional optical orthogonal codes.
[BibTeX]
[DOI]
Jianmin Wang
,
Xiuling Shan
,
Jianxing Yin
Des. Codes Cryptogr., 2010

2009
Optimal grid holey packings with block size 3 and 4.
[BibTeX]
[DOI]
Bin Wen
,
Jianmin Wang
,
Jianxing Yin
Des. Codes Cryptogr., 2009

2008
Some combinatorial constructions for optimal perfect deletion-correcting codes.
[BibTeX]
[DOI]
Jianmin Wang
Des. Codes Cryptogr., 2008

2002
Existence of Perfect 4-Deletion-Correcting Codes with Length Six.
[BibTeX]
Nabil Shalaby
,
Jianmin Wang
,
Jianxing Yin
Des. Codes Cryptogr., 2002


  Loading...