Rong Luo

Rong Luo

Auto-generated profile, based on publicly available information

Rong Luo

School of Mathematics, Southwest Jiaotong University, Chengdu, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 November 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
LXLi Xu
Li Xu
CFCuiling Fan
Cuiling Fan
Sihem MesnagerSihem Mesnager
Sihem Mesnager
RLRong Luo
Rong Luo
HYHaode Yan
Haode Yan
Subfield codes of linear codes over finite fields have recently received much attention since they can produce optimal codes, which may have applications in secret sharing, authentication codes and association schemes. In this paper, we first present a construction framework of 3-dimensional linear codes ${\mathcal{ C}}_{f,g}$ over $\mathbb {F}_{q^{m}}$ parameterized by any two functions $f, g$ over $\mathbb {F}_{q^{m}}$ , and then study the properties of six types of ${\mathcal{ C}}_{f,g}$ , its punctured code ${\mathcal{ C}}^{\ast}_{f,g}$ and their corresponding subfield codes over $\mathbb {F}_{q}$ . The classification of ${\mathcal{ C}}_{f,g}$ is based on special choices of $f,g$ as trace function, norm function, almost bent function, Boolean bent function or a combination of these functions. For the first two types of ${\mathcal{ C}}_{f,g}$ , we explicitly determine the weight distributions and dualities of ${\mathcal{ C}}_{f,g}, {\mathcal{ C}}_{f,g}^{\ast}$ and their subfield codes over $\mathbb {F}_{q}$ . The remaining four types of ${\mathcal{ C}}_{f,g}$ are restricted to $q=2$ , and the weight distributions and dualities of the subfields code ${\mathcal{ C}}_{f,g}^{(q)}$ and ${\cal C_{f,g}^{\ast}}^{(q)}$ are completely determined. Most of the resultant linear codes (over $\mathbb {F}_{q^{m}}$ or over $\mathbb {F}_{q}$ ) have few weights. Some of them are optimal and some have the best-known parameters according to the tables maintained at https://www.codetables.de . In fact, 16 infinite families of optimal linear codes are produced in this paper. As a byproduct, a family of $[2^{4m-2},2m+1,2^{4m-3}]$ quaternary Hermitian self-orthogonal codes are obtained with $m \geq 2$ . As an application, we present several infinite families of 2-designs or 3-designs with some of the codes presented in this paper.

16 January 2019 in IEEE Access
Verified
Journal Article
Open access
YSYanli Shi
Yanli Shi
LWLibo Wang
Libo Wang
RLRong Luo
Rong Luo
This paper investigates the performance of the block multiple measurement vectors (BMMV) algorithm in reconstructing block joint sparse matrices. We prove that if Ф obeys block restricted isometry property with δ K+1 < 1/√K+1, then BMMV perfectly reconstructs any block K-joint sparse matrix X from observations Y = ФX in K iterations.We also show that BMMV may not reconstruct block K-joint sparse matrices in K iterations under the condition δ K+1 ≥ 1/√K+1. That is to say, the condition δ K+1 < 1/√K+1 is optimal for the BMMV algorithm.

1 December 2017 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
RLRong Luo
Rong Luo
Udaya ParampalliUdaya Parampalli
Udaya Parampalli

23 March 2018 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
MHMiaomiao Han
Miaomiao Han
YLYou Lu
You Lu
RLRong Luo
Rong Luo
ZMZhengke Miao
Zhengke Miao

11 February 2019 in IEEE Access
Verified
Journal Article
Open access
WWWeina Wang
Weina Wang
YSYanli Shi
Yanli Shi
RLRong Luo
Rong Luo
This paper addresses the problem of economic time series forecasting, and a new prediction method is proposed. The method fully capitalizes on the two key technologies, sparse representation and fuzzy set theory, to handle the stock time series forecasting problems. Firstly, sparse representation is applied to smooth the time series. Then, fuzzy technology is used to convert time series into fuzzy series. Based on the number of the occurrence of fuzzy sets, the weights are calculated. Finally, the future value of time series can be forecasted using the weights and inverse transformation of sparse representation. The experimental results show that the proposed method produces more accurate forecasted results.

1 November 2025 in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Verified
Journal Article
Open access
PDF file
LZLiliang Zhou
Liliang Zhou
ZYZengrui Yi
Zengrui Yi
RLRong Luo
Rong Luo
ZZZhengchun Zhou
Zhengchun Zhou
Automatic modulation recognition in low-computation edge devices under noisy environments has become increasingly critical. To address the dual challenges of lightweight design and noise resistance, this paper proposes WCTFormer, a novel lightweight network that integrates discrete wavelet transform for frequency-domain noise suppression and a Transformer for global feature extraction, enabling robust performance in low SNR conditions. Experiments on open-source datasets demonstrate that WCTFormer achieves superior recognition accuracy, with 92.40% accuracy at 0 dB SNR, requiring only 60K parameters. WCTFormer combines high recognition performance and computational efficiency, making it suitable for deployment in resource-constrained edge devices.