More Like this

1. 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
2. List Ramsey numbers

   https://doi.org/10.1002/jgt.22610  

   Alon, Noga ; Bucić, Matija ; Kalvari, Tom ; Kuperwasser, Eden ; Szabó, Tibor ( January 2021 , Journal of Graph Theory)

   null (Ed.)
3. Layered List Labeling

   https://doi.org/10.1145/3651602  

   Bender, Michael A. ; Conway, Alex ; Farach-Colton, Martin ; Komlos, Hanna ; Kuszmaul, William ( June 2024 , PODS)
4. Five-list-coloring graphs on surfaces III. One list of size one and one list of size two

   https://doi.org/10.1016/j.jctb.2017.06.004  

   Postle, Luke ; Thomas, Robin ( January 2018 , Journal of Combinatorial Theory, Series B)
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.)