Huangsheng Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Huangsheng Yu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Dianhua Wu
School of Mathematics and Statistics Guangxi Normal University Guilin China
4 shared publications - Feifei Xie
Guangxi Key Lab of Multi-source Information Mining & Security, Department of Mathematics, Guangxi Normal University, Guilin 541004, China
1 shared publication - Hantao Zhang
The University of Iowa
1 shared publication - Hengming Zhao
Key Laboratory of Education Blockchain and Intelligent Technology, Ministry of Education, and Guangxi Key Laboratory of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin, China
1 shared publication - Jinhua Wang
School of Sciences, Nantong University, Nantong, People’s Republic of China
1 shared publication Shujuan Dang
Key Lab of Multi-Source Information Mining and Security; Department of Mathematics, Guangxi Normal University, Guilin 541004, China
1 shared publication
Latest Publications
- Open Access
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (2) , 297-312
Further results on optimal $ (n, \{3, 4, 5\}, \Lambda_a, 1, Q) $-OOCs
Let$ W = \{w_1, w_2, \cdots, w_r\} $ be a set of$ r $ integers greater than 1,$ \Lambda_a = (\lambda_a^{(1)}, \lambda_a^{(2)}, \cdots, \lambda_a^{(r)}) $ be an$ r $ -tuple of positive integers,$ \lambda_c $ be a positive integer, and$ Q = (q_1, q_2, \cdots, q_r) $ be an$ r $ -tuple of positive rational numbers whose sum is 1. Variable-weight optical orthogonal code ($ (n, W, \Lambda_a, \lambda_c, Q) $ -OOC) was introduced by Yang for multimedia optical CDMA systems with multiple quality of service requirements. In this paper, tight upper bounds on the maximum code size of$ (n, \{3, 4, 5\}, \Lambda_a, 1, Q) $ -OOCs are obtained, and infinite classes of optimal$ (n, \{3, 4, 5\}, \Lambda_a, 1, Q) $ -OOCs are constructed.- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (2) , 297-312
Open AccessFurther results on optimal $ (n, \{3, 4, 5\}, \Lambda_a, 1, Q) $-OOCs
Let$ W = \{w_1, w_2, \cdots, w_r\} $ be a set of$ r $ integers greater than 1,$ \Lambda_a = (\lambda_a^{(1)}, \lambda_a^{(2)}, \cdots, \lambda_a^{(r)}) $ be an$ r $ -tuple of positive integers,$ \lambda_c $ be a positive integer, and$ Q = (q_1, q_2, \cdots, q_r) $ be an$ r $ -tuple of positive rational numbers whose sum is 1. Variable-weight optical orthogonal code ($ (n, W, \Lambda_a, \lambda_c, Q) $ -OOC) was introduced by Yang for multimedia optical CDMA systems with multiple quality of service requirements. In this paper, tight upper bounds on the maximum code size of$ (n, \{3, 4, 5\}, \Lambda_a, 1, Q) $ -OOCs are obtained, and infinite classes of optimal$ (n, \{3, 4, 5\}, \Lambda_a, 1, Q) $ -OOCs are constructed. - 15 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (2) , 1361-1367
Bounds and Constructions for Optimal $(n, \{3, 4, 5\}, \Lambda _a, 1, Q)$ -OOCsLet W = {w1,...,wr} be a set of positive integers, λc a positive integer, ∧a = (λ(1) a ,...λ(r) a ) an r-tuple of positive integers, and Q = (q1,...qr) an r-tuple of positive rational numbers whose sum is 1. In 1996, Yang introduced variable-weight optical orthogonal code, (n,W,∧a, λc, Q)-OOC, for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. Some work had been done on the constructions of optimal (n,W,∧a,1,Q)-OOCs with unequal auto-correlation constraints for W = {3, 4} and {3, 5}, while little is known on optimal (n,W,∧a,1,Q)-OOCs for │W│ ≥ 3. In this paper, we focus our main attentions on (n, {3, 4, 5},∧a,1,Q)-OOCs whith ∧a ∈ {(2, 1, 1), (2, 1, 2), (2, 2, 1), (2, 2, 2)}. Tight upper bounds on the maximum code size of (n, {3, 4, 5};∧a,1,Q)-OOCs are obtained, and infinite classes of optimal (n; {3, 4, 5},∧a,1,Q)-OOCs are constructed.
- 15 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (2) , 1361-1367
Bounds and Constructions for Optimal $(n, \{3, 4, 5\}, \Lambda _a, 1, Q)$ -OOCsLet W = {w1,...,wr} be a set of positive integers, λc a positive integer, ∧a = (λ(1) a ,...λ(r) a ) an r-tuple of positive integers, and Q = (q1,...qr) an r-tuple of positive rational numbers whose sum is 1. In 1996, Yang introduced variable-weight optical orthogonal code, (n,W,∧a, λc, Q)-OOC, for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. Some work had been done on the constructions of optimal (n,W,∧a,1,Q)-OOCs with unequal auto-correlation constraints for W = {3, 4} and {3, 5}, while little is known on optimal (n,W,∧a,1,Q)-OOCs for │W│ ≥ 3. In this paper, we focus our main attentions on (n, {3, 4, 5},∧a,1,Q)-OOCs whith ∧a ∈ {(2, 1, 1), (2, 1, 2), (2, 2, 1), (2, 2, 2)}. Tight upper bounds on the maximum code size of (n, {3, 4, 5};∧a,1,Q)-OOCs are obtained, and infinite classes of optimal (n; {3, 4, 5},∧a,1,Q)-OOCs are constructed.
- Open Access
- 1 November 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 10 (4) , 811-823
New optimal $(v, \{3,5\}, 1, Q)$ optical orthogonal codes- 1 November 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 10 (4) , 811-823
Open AccessNew optimal $(v, \{3,5\}, 1, Q)$ optical orthogonal codes - 12 February 2016
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (5) , 2159-2170
The Existence of Irrational Diagonally Ordered Magic Squares
- 12 February 2016
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (5) , 2159-2170
The Existence of Irrational Diagonally Ordered Magic Squares