23 citations · 148 across the 60 of their papers we have counts for
8 papers · 2 filters
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields
Xianhua Niu, Chaoping Xing
In literatures, there are various constructions of frequency hopping sequence (FHS for short) sets with good Hamming correlations. Some papers employed only multiplicative groups o…
Construction of optimal locally recoverable codes and connection with hypergraph
Chaoping Xing, Chen Yuan
Recently, it was discovered by several authors that a -ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length…
Asymptotic Gilbert-Varshamov bound on Frequency Hopping Sequences
Xianhua Niu, Chaoping Xing, Chen Yuan
Given a -ary frequency hopping sequence set of length and size with Hamming correlation , one can obtain a -ary (nonlinear) cyclic code of length and size …
Constructions of maximally recoverable local reconstruction codes via function fields
Venkatesan Guruswami, Lingfei Jin, Chaoping Xing
Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. A maximally recoverable (MR) LRC…
How long can optimal locally repairable codes be?
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
A locally repairable code (LRC) with locality allows for the recovery of any erased codeword symbol using only other codeword symbols. A Singleton-type bound dictates the b…
New extension constructions of optimal frequency hopping sequence sets
Xianhua Niu, Chaoping Xing
In this paper, a general framework of constructing optimal frequency hopping sequence (FHS) sets is presented based on the designated direct product. Under the framework, we obtain…