research
∙
01/05/2023
Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes
Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the addit...
share
research
∙
12/10/2021
Singleton-type bounds for list-decoding and list-recovery, and related results
List-decoding and list-recovery are important generalizations of unique ...
research
∙
05/31/2021
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate
Understanding the limits of list-decoding and list-recovery of Reed-Solo...
research
∙
11/09/2020
Improved List-Decodability of Reed–Solomon Codes via Tree Packings
This paper shows that there exist Reed–Solomon (RS) codes, over large fi...
research
∙
04/03/2020
Error Detection and Correction in Communication Networks
Let G be a connected graph on n vertices and C be an (n,k,d) code with d...
research
∙
11/04/2019
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson ra...
research
∙
02/15/2019
Universally Sparse Hypergraphs with Applications to Coding Theory
For fixed integers r> 2,e> 2,v> r+1, an r-uniform hypergraph is called G...
research
∙
12/23/2018
