Dianhua Wu

Orcid: 0000-0002-2966-0606

Affiliations:
  • Guangxi Normal University, Department of Mathematics, Guilin, China


According to our database1, Dianhua Wu authored at least 53 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Holey Schröder designs of type 3<sup><i>n</i></sup><i>u</i><sup>1</sup>.
Discret. Math., September, 2023

Cascaded Code Distributed Computing With Low Complexity and Improved Flexibility.
CoRR, 2023

2022
4<sup>2</sup>-Decomposable super-simple (<i>v</i>, 4, 8)-BIBDs.
Discret. Math., 2022

Constructions of balanced (<i>N</i>, <i>M</i>, {4, 5}, 1;2) Multilength Variable-Weight optical orthogonal codes.
Adv. Math. Commun., 2022

2021
On balanced (Z4u×Z8v, {4, 5}, 1) difference packings.
Discret. Math., 2021

Constructions and Applications of Perfect Difference Matrices and Perfect Difference Families.
CoRR, 2021

2019
Further results on optimal (n, {3,4,5}, Λ<sub>a</sub>, 1, Q)-OOCs.
Adv. Math. Commun., 2019

Constructions of optimal balanced (m, n, 4, 5, 1)-OOSPCs.
Adv. Math. Commun., 2019

2018
Bounds and Constructions for Optimal (n, {3, 4, 5}, Λ<sub>a</sub>, 1, Q)-OOCs.
IEEE Trans. Inf. Theory, 2018

2017
New (q, K, λ)-ADFs via cyclotomy.
Discret. Math., 2017

2016
Bounds and constructions for optimal (n, {3, 5}, Λ<sub>a</sub>, 1, Q)-OOCs.
Discret. Math., 2016

New optimal (v, {3, 5}, 1, Q) optical orthogonal codes.
Adv. Math. Commun., 2016

2015
Two new classes of binary sequence pairs with three-level cross-correlation.
Adv. Math. Commun., 2015

New Optimal (14p, {4, 5}, 1, (3/4, 1/4))-OOCs.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

2014
Further results on balanced (n, {3, 4}, Λ<sub>a</sub>, 1)-OOCs.
Discret. Math., 2014

Bounds and constructions for (v, W, 2, Q)-OOCs.
Discret. Math., 2014

Multimedia IPP Codes with Efficient Tracing.
CoRR, 2014

2013
Some Infinite Classes of Optimal (v, {3, 4}, 1, Q)-OOCs with $${Q \in \{(\frac {1}{3}, \frac {2}{3}), (\frac {2}{3}, \frac{1}{3})\}}$$.
Graphs Comb., 2013

On optimal (v, 5, 2, 1) optical orthogonal codes.
Des. Codes Cryptogr., 2013

Perfect difference families and related variable-weight optical orthogonal codes.
Australas. J Comb., 2013

Optimal two-dimensional variable-weight optical orthogonal codes via scarce mixed difference families.
Proceedings of the Sixth International Workshop on Signal Design and Its Applications in Communications, 2013

2012
Some New Classes of Zero-Difference Balanced Functions.
IEEE Trans. Inf. Theory, 2012

New Infinite Classes of Optimal (υ, {<i>k</i>, 6}, 1, <i>Q</i>) Optical Orthogonal Codes via Quadratic Residues.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Constructions of Optimal (υ, {4, 5, 6}, 1, <i>Q</i>)-OOCs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

New Classes of Optimal Variable-Weight Optical Orthogonal Codes with Hamming Weights 3 and 4.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

General Constructions for (υ, 4, 1) Optical Orthogonal Codes via Perfect Difference Families.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

A construction for doubly pandiagonal magic squares.
Discret. Math., 2012

The existence of doubly disjoint (mt+1, m, m-1) difference families.
Ars Comb., 2012

2011
General Constructions of Optimal Variable-Weight Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, 2011

Relative Difference Families With Variable Block Sizes and Their Related OOCs.
IEEE Trans. Inf. Theory, 2011

Further results on optimal (v, {3, k}, 1, {1/2, 1/2})-OOCs for k=4, 5.
Discret. Math., 2011

A note on balanced (q, {3, 4}, λ)-DFs with q a prime power.
Australas. J Comb., 2011

Further constructions of optimal variable-weight optical orthogonal codes.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

More results on optimal optical orthogonal codes with weight four.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

2010
Optimal variable-weight optical orthogonal codes via difference packings.
IEEE Trans. Inf. Theory, 2010

New Classes of Optimal Variable-Weight Optical Orthogonal Codes Based on Cyclic Difference Families.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

The existence of balanced (<i>υ</i>, {3, 6}, 1) difference families.
Sci. China Inf. Sci., 2010

New Optimal Variable-Weight Optical Orthogonal Codes.
Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2009
Constructions of optimal quaternary constant weight codes via group divisible designs.
Discret. Math., 2009

Applications of additive sequence of permutations.
Discret. Math., 2009

The existence of (v, 4, λ) disjoint difference families.
Australas. J Comb., 2009

Optimal variable-weight optical orthogonal codes via cyclic difference families.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
A TWOOA construction for multi-receiver multi-message authentication codes.
J. Math. Cryptol., 2008

Good equidistant codes constructed from certain combinatorial designs.
Discret. Math., 2008

A note on the existence of balanced (q, {3, 4}, 1) difference families.
Australas. J Comb., 2008

2006
Generalized Steiner systems GS<sub>5</sub>(2, 5, v, 5).
Australas. J Comb., 2006

2005
Existence of Generalized Steiner Systems <i>GS</i>(2, 4, v, 2).
Des. Codes Cryptogr., 2005

Some new optimal quaternary constant weight codes.
Sci. China Ser. F Inf. Sci., 2005

2004
Existence of APAV(q, k) with q a prime power =5(mod 8) and k=1(mod 4).
Discret. Math., 2004

2003
Optimal holey packing OHP<sub>4</sub>(2, 4, v, 2) for v≡2 (mod 3).
Australas. J Comb., 2003

2001
Bounds and constructions for TWOOAs.
Discret. Math., 2001

Generalized Steiner Systems GS(2, 4, v, 2) with a Prime Power equiv 7 (mod 12).
Des. Codes Cryptogr., 2001

2000
Generalized Steiner Triple Systems with Group Size g = 7, 8.
Ars Comb., 2000


  Loading...