| 2021 | ISIT | Codes approaching the Shannon limit with polynomial complexity per information bit. | Ilya Dumer, Navid Gharavi |
| 2021 | ITW | Combined polar-LDPC design for channels with high noise. | Ilya Dumer, Navid Gharavi |
| 2020 | ISITA | Codes for high-noise memoryless channels. | Ilya Dumer, Navid Gharavi |
| 2017 | ISIT | Polar codes with a stepped boundary. | Ilya Dumer |
| 2016 | ISIT | Distance verification for LDPC codes. | Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko |
| 2014 | ISIT | Numerical techniques for finding the distances of quantum codes. | Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko |
| 2013 | ISIT | Spherically punctured Reed-Muller codes. | Olga Kapralova, Ilya Dumer |
| 2013 | ITA | Linked-cluster technique for finding the distance of a quantum LDPC code. | Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko |
| 2012 | ISIT | Spherically punctured biorthogonal codes. | Ilya Dumer, Olga Kapralova |
| 2011 | ISIT | Soft-decision list decoding of Reed-Muller codes with linear complexity. | Ilya Dumer, Grigory Kabatiansky, Cdric Tavernier |
| 2010 | ISIT | Clustered bounded-distance decoding of codeword-stabilized quantum codes. | Yunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko |
| 2008 | ISIT | Error exponents for two soft decision decoding algorithms of Reed-Muller codes. | Marat V. Burnashev, Ilya Dumer |
| 2007 | ISIT | Fingerprinting Capacity Under the Marking Assumption. | N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer |
| 2007 | ISIT | Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes. | Ilya Dumer, Grigory Kabatiansky, Cdric Tavernier |
| 2006 | ISIT | Error exponents for recursive decoding of Reed-Muller codes. | Marat V. Burnashev, Ilya Dumer |
| 2006 | ISIT | Covering spheres and balls with smaller balls. | Ilya Dumer |
| 2006 | ISIT | List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity. | Ilya Dumer, Grigory Kabatiansky, Cdric Tavernier |
| 2004 | ISIT | On polylogarithmic decoding complexity for reed-muller codes. | Ilya Dumer |
| 2004 | ISIT | On the thinnest coverings of ellipsoids. | Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov |
| 2003 | ITW | On recursive decoding with sublinear complexity for Reed-Muller codes. | Ilya Dumer |
| 1999 | FOCS | Hardness of Approximating the Minimum Distance of a Linear Code. | Ilya Dumer, Daniele Micciancio, Madhu Sudan |