RQRongcun Qin
Rongcun Qin
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rongcun Qin has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- 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
7 shared publications - Dianhua Wu
School of Mathematics and Statistics Guangxi Normal University Guilin China
5 shared publications - Huangsheng Yu
School of Mathematics and Statistics, Guangxi Normal University, Guilin, China
1 shared publication - Marco Buratti
Dipartimento di Scienze di Base e Applicate per l’Ingegneria (SBAI), Sapienza Università di Roma, Roma, Italy
1 shared publication - Minquan Cheng
Guangxi Normal University
1 shared publication - Wei Li1 shared publication
Latest Publications
- 18 February 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 2263-2296
Optimal two-dimensional multilength optical orthogonal codes via compatible mixed difference packing set systems
- 18 February 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 2263-2296
Optimal two-dimensional multilength optical orthogonal codes via compatible mixed difference packing set systems
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (1) , 1-10
A few more optimal optical orthogonal codes with non-constant auto-correlation function
In the last decade many variants of the well-known notion of an optical orthogonal code (OOC) have been studied. In particular, it was allowed to have variable weights and that codewords of different weight may have different autocorrelation parameters so that one should speak of 'autocorrelation function' rather than 'autocorrelation parameter'. In this paper we investigate OOCs with two weights 4 and 5, autocorrelation function with values in $ \{1, 2\} $, and crosscorrelation parameter one. After giving tight upper bounds on their maximum size, we construct some infinite classes reaching optimality with as many codewords of weight 4 as many codewords of weight 5.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (1) , 1-10
A few more optimal optical orthogonal codes with non-constant auto-correlation function
In the last decade many variants of the well-known notion of an optical orthogonal code (OOC) have been studied. In particular, it was allowed to have variable weights and that codewords of different weight may have different autocorrelation parameters so that one should speak of 'autocorrelation function' rather than 'autocorrelation parameter'. In this paper we investigate OOCs with two weights 4 and 5, autocorrelation function with values in $ \{1, 2\} $, and crosscorrelation parameter one. After giving tight upper bounds on their maximum size, we construct some infinite classes reaching optimality with as many codewords of weight 4 as many codewords of weight 5.- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (1) , 163-178
Balanced ($\mathbb{Z} _{2u}\times \mathbb{Z}_{38v}$, {3, 4, 5}, 1) difference packings and related codes
Let $ m $, $ n $ be positive integers, and $ K $ a set of positive integers with size greater than 2. An $ (m,n,K,1) $ optical orthogonal signature pattern code, $ (m,n,K,1) $-OOSPC, was introduced by Kwong and Yang for 2-D image transmission in multicore-fiber optical code-division multiple-access (OCDMA) networks with multiple quality of services (QoS) requirement. Let $ G $ be an additive group, a balanced $ (G, K, 1) $ difference packing, $ (G, K, 1) $-BDP, can be used to construct a balanced $ (m,n,K,1) $-OOSPC when $ G = {\mathbb{Z}}_m\times {\mathbb{Z}}_n $. In this paper, the existences of optimal $ ( {\mathbb{Z}}_{2u}\times {\mathbb{Z}}_{38v}, \{3,4,5\},1) $-BDPs are completely solved with $ u, \ v\equiv 1\pmod2 $, and the corresponding optimal balanced $ (2u, 38v,\{3,4,5\},1) $-OOSPCs are also obtained.- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (1) , 163-178
Balanced ($\mathbb{Z} _{2u}\times \mathbb{Z}_{38v}$, {3, 4, 5}, 1) difference packings and related codes
Let $ m $, $ n $ be positive integers, and $ K $ a set of positive integers with size greater than 2. An $ (m,n,K,1) $ optical orthogonal signature pattern code, $ (m,n,K,1) $-OOSPC, was introduced by Kwong and Yang for 2-D image transmission in multicore-fiber optical code-division multiple-access (OCDMA) networks with multiple quality of services (QoS) requirement. Let $ G $ be an additive group, a balanced $ (G, K, 1) $ difference packing, $ (G, K, 1) $-BDP, can be used to construct a balanced $ (m,n,K,1) $-OOSPC when $ G = {\mathbb{Z}}_m\times {\mathbb{Z}}_n $. In this paper, the existences of optimal $ ( {\mathbb{Z}}_{2u}\times {\mathbb{Z}}_{38v}, \{3,4,5\},1) $-BDPs are completely solved with $ u, \ v\equiv 1\pmod2 $, and the corresponding optimal balanced $ (2u, 38v,\{3,4,5\},1) $-OOSPCs are also obtained.- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 16 (4) , 1197-1209
Constructions of balanced (N, M, {4, 5}, 1;2) Multilength Variable-Weight optical orthogonal codes
Multilength variable-weight optical orthogonal codes(MLVWOOCs) are recently proposed for supporting multirate and integrated multimedia services in optical code division multiple access (OCDMA) networks. Some work had been done on MLVWOOCs with weight set$ W = \{3, 4\} $ ,$ \{3, 5\} $ . In this paper, we consider MLVWOOCs with$ W = \{4, 5\} $ , and some several infinite classes of optimal MLVWOOCs are obtained.- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 16 (4) , 1197-1209
Constructions of balanced (N, M, {4, 5}, 1;2) Multilength Variable-Weight optical orthogonal codes
Multilength variable-weight optical orthogonal codes(MLVWOOCs) are recently proposed for supporting multirate and integrated multimedia services in optical code division multiple access (OCDMA) networks. Some work had been done on MLVWOOCs with weight set$ W = \{3, 4\} $ ,$ \{3, 5\} $ . In this paper, we consider MLVWOOCs with$ W = \{4, 5\} $ , and some several infinite classes of optimal MLVWOOCs are obtained.- 1 September 2021
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (11) , 2613-2645
Compatible difference packing set systems and their applications to multilength variable-weight OOCs
- 1 September 2021
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (11) , 2613-2645
Compatible difference packing set systems and their applications to multilength variable-weight OOCs
- 8 October 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (1) , 112170
Bounds and constructions for multilength variable-weight optical orthogonal codes
- 8 October 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (1) , 112170
Bounds and constructions for multilength variable-weight optical orthogonal codes
- Open Access
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (2) , 329-341
Constructions of optimal balanced $ (m, n, \{4, 5\}, 1) $-OOSPCs
Kitayama proposed a novel OCDMA (called spatial CDMA) for parallel transmission of 2-D images through multicore fiber. Optical orthogonal signature pattern codes (OOSPCs) play an important role in this CDMA network. Multiple-weight (MW) optical orthogonal signature pattern code (OOSPC) was introduced by Kwong and Yang for 2-D image transmission in multicore-fiber optical code-division multiple-access (OCDMA) networks with multiple quality of services (QoS) requirements. Some results had been done on optimal balanced$ (m, n, \{3, 4\}, 1) $ -OOSPCs. In this paper, it is proved that there exist optimal balanced$ (2u, 16v, \{4, 5\}, 1) $ -OOSPCs for odd integers$ u\geq 1 $ ,$ v\geq 1 $ .- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (2) , 329-341
Open AccessConstructions of optimal balanced $ (m, n, \{4, 5\}, 1) $-OOSPCs
Kitayama proposed a novel OCDMA (called spatial CDMA) for parallel transmission of 2-D images through multicore fiber. Optical orthogonal signature pattern codes (OOSPCs) play an important role in this CDMA network. Multiple-weight (MW) optical orthogonal signature pattern code (OOSPC) was introduced by Kwong and Yang for 2-D image transmission in multicore-fiber optical code-division multiple-access (OCDMA) networks with multiple quality of services (QoS) requirements. Some results had been done on optimal balanced$ (m, n, \{3, 4\}, 1) $ -OOSPCs. In this paper, it is proved that there exist optimal balanced$ (2u, 16v, \{4, 5\}, 1) $ -OOSPCs for odd integers$ u\geq 1 $ ,$ v\geq 1 $ .