_id,doi,title
14665,10.1109/TIT.2023.3334032,Multiple packing: Lower bounds via error exponents
14751,10.1109/tit.2023.3257239,Zero-error communication over adversarial MACs
13269,10.1109/TIT.2023.3292219,Codes for the Z-channel
12838,10.1109/TIT.2023.3260950,Multiple packing: Lower bounds via infinite constellations
10775,10.1109/TIT.2022.3148779,List-decodability with large radius for Reed-Solomon codes
11639,10.1109/TIT.2022.3189542,List decoding random Euclidean codes and Infinite constellations
12273,10.1109/tit.2022.3167554,Quadratically constrained myopic adversarial channels
9002,10.1109/TIT.2020.3038806,Binary linear codes with optimal scaling: Polar codes with large kernels
6730,10.1109/tit.2017.2673829,"Reed–Muller codes achieve capacity on erasure channels"
6732,10.1109/tit.2016.2616117,"Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors"