3 papers
math.CO2026
The climb problem for -general sets in PG(n,4)
Liangdong Lu, Ruipan Yang, Qiang Fu +1
A -general set of PG(n,q) is a point set with no four coplanar,and Mb{n}{q} is the largest such size. The climb problem asks, at each , whether the constructions of Pavese (2…
cs.IT2026
Hermitian Hulls of Cyclic Codes and Exact Dual Distances of Extended Linear Codes
Liangdong Lu, Ruipan Yang, Yang Liu +2
Let be an linear code over $\F_{q^2}$ with parity-check matrix . The rank $r=\Rank(HH^{\dagger})$ measures how far the Hermitian dual $\mathcal{C}^{\perp…
cs.IT2026
Quantum Locally Repairable Codes from Negacyclic and Repeated-Root Cyclic Codes over Small Fields
Ruipan Yang, Qiang Fu, Liangdong Lu
Quantum locally recoverable codes (qLRCs), introduced recently by Golowich and Guruswami, allow any single-qudit erasure to be recovered from a small set of other qudits. Most know…