4 citations · 8 across the 11 of their papers we have counts for
5 papers · 1 filter
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
Chong Shangguan, Yulin Yang
LDPC codes play a vital role in coding theory and practical error correction. A central problem in this direction is to understand their rate--distance tradeoff. In this paper, we…
Singleton-type bounds for list-decoding and list-recovery, and related results
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
List-decoding and list-recovery are important generalizations of unique decoding that received considerable attention over the years. However, the optimal trade-off among list-deco…
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
Zeyu Guo, Ray Li, Chong Shangguan +2
This paper shows that there exist Reed--Solomon (RS) codes, over \black{exponentially} large finite fields \black{in the code length}, that are combinatorially list-decodable well…
Error Detection and Correction in Communication Networks
Chong Shangguan, Itzhak Tamo
Let be a connected graph on vertices and be an code with , defined on the alphabet set . Suppose that for , the -th vertex…
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
Chong Shangguan, Itzhak Tamo
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions since the work of Guruswami and Sudan. It is now known by the w…