5 citations · 5 across the 1 of their papers we have counts for
7 papers · 1 filter
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery
Nicolas Resch, Chen Yuan, Yihan Zhang
In this work we consider the list-decodability and list-recoverability of arbitrary -ary codes, for all integer values of . A code is called -list-decodable if…
Threshold Rates of Codes Ensembles: Linear is Best
Nicolas Resch, Chen Yuan
In this work, we prove new results concerning the combinatorial properties of random linear codes. Firstly, we prove a lower bound on the list-size required for random linear codes…
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 …
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…
List Decodability of Symbol-Pair Codes
Shu Liu, Chaoping Xing, Chen Yuan
We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that list decodability of every symbol-pair code does not exceed the Gilbert-Varsha…