More Like this

1. List-Decoding Barnes–Wall Lattices

   https://doi.org/10.1007/s00037-016-0151-x  

   Grigorescu, Elena; Peikert, Chris (June 2017, computational complexity)
2. Bounds on the List Size of Successive Cancellation List Decoding

   https://doi.org/10.1109/SPCOM50965.2020.9179593  

   Coskun, Mustafa Cemil; Pfister, Henry D. (July 2020, 2020 International Conference on Signal Processing and Communications (SPCOM))

   Successive cancellation list decoding of polar codes provides very good performance for short to moderate block lengths. However, the list size required to approach the performance of maximum-likelihood decoding is still not well understood theoretically. This work identifies information-theoretic quantities that are closely related to this required list size. It also provides a natural approximation for these quantities that can be computed efficiently even for very long codes. Simulation results are provided for the binary erasure channel as well as the binary-input additive white Gaussian noise channel. 

   more » « less
3. LDPC Codes Achieve List Decoding Capacity

   https://doi.org/10.1109/FOCS46700.2020.00050  

   Mosheiff, Jonathan; Resch, Nicolas; Ron-Zewi, Noga; Silas, Shashwat; Wootters, Mary (November 2020, Foundations of Computer Science (FOCS 2020))

   null (Ed.)
4. List Decoding of Direct Sum Codes

   https://doi.org/10.1137/1.9781611975994.85  

   Alev, Vedat Levi; Jeronimo, Fernando Granha; Quintana, Dylan; Srivastava, Shashank; Tulsiani, Madhur (January 2020, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms)
5. Bounds for List-Decoding and List-Recovery of Random Linear Codes

   https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.9  

   Guruswami, Venkatesan; Li, Ray; Mosheiff, Jonathan; Resch, Nicolas; Silas, Shashwat; Wootters, Mary (July 2020, Leibniz international proceedings in informatics)

   null (Ed.)