SearcharxivSearch

arXiv subjects

Linzhi Shen

Publications and source records attributed to Linzhi Shen.

4 recordsLinked to original sources

A Foundation Model for Large-Scale Wireless Network Planning , Operation and Optimization

Wireless cellular networks provide critical infrastructure for communication, transportation and industry, making reliable connectivity essential to modern society. Delivering this connectivity requires accurate models of the radio environment shaped jointly by network infrastructure and their surroundings. Such models underpin base-station deployment, network operation and parameter optimization, yet city-scale radio environments remain difficult to capture. Physics-based tools require detailed site descriptions and computation, whereas task-specific models need dedicated measurements and transfer poorly across deployments. Here we introduce ChaRT, a foundation model that learns transferable radio representations from measurement reports routinely generated by operational cellular networks. These reports provide abundant joint observations across multiple cells and beams without additional measurement campaigns. ChaRT incorporates beam-level angular structure, network hierarchy and propagation-regime diversity into its architecture, and is pretrained through context-aware masked beam modelling and self-distillation. We train ChaRT on more than one billion reports comprising 18.2 billion beam-level observations from 3,503 cells in one city. With a single set of weights, ChaRT reconstructs radio environments in unseen cities and transfers to new-site prediction, radio map construction and network parameter tuning. With only 1% of labelled data, it supports user localization, beam prediction, propagation scenario classification and estimation of the signal-to-interference-plus-noise ratio. The learned representation further enables beamspace clustering for reusable radio-grid construction. These results establish operational measurement reports as a scalable data foundation for transferable cellular-network intelligence.

eess.SP

Skew Generalized Quasi-Cyclic Codes over Finite Fields

In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem over the skew polynomial ring, which leads to a canonical decomposition of skew GQC codes. We also focus on some characteristics of skew GQC codes in details. For a 1-generator skew GQC code, we define the parity-check polynomial, determine the dimension and give a lower bound on the minimum Hamming distance. The skew quasi-cyclic (QC) codes are also discussed briefly.

cs.IT

Quasi-Cyclic Codes Over Finite Chain Rings

In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to obtain the one and only one generator for each 1-generator QC code.

cs.IT

Generalized Quasi-Cyclic Codes Over $\mathbb{F}_q+u\mathbb{F}_q$

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem, structural properties and the decomposition of GQC codes are given. For 1-generator GQC codes, minimal generating sets and lower bounds on the minimum distance are given. As a special class of GQC codes, quasi-cyclic (QC) codes over $\mathbb{F}_q+u\mathbb{F}_q$ are also discussed briefly in this paper.

cs.IT