List-decodable zero-rate codes
We consider list decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal τ ϵ [0,1] for which there exists an arrangement of M balls of relative Hamming radius τ in the binary hypercube (of arbitrary dimension)...
Main Authors: | Alon, Noga, Bukh, Boris, Polyanskiy, Yury |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2020
|
Online Access: | https://hdl.handle.net/1721.1/124995 |
Similar Items
-
Upper Bound on List-Decoding Radius of Binary Codes
by: Polyanskiy, Yury
Published: (2019) -
Upper bound on list-decoding radius of binary codes
by: Polyanskiy, Yury
Published: (2016) -
List Decoding of Arıkan’s PAC Codes
by: Hanwen Yao, et al.
Published: (2021-06-01) -
List decoding of error-correcting codes
by: Guruswami, Venkatesan, 1976-
Published: (2005) -
Partial Order-Based Decoding of Rate-1 Nodes in Fast Simplified Successive-Cancellation List Decoders for Polar Codes
by: Lucas Johannsen, et al.
Published: (2022-02-01)