Ilya Dumer

According to our database, Ilya Dumer authored at least 54 papers between 1991 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2021

Combined polar-LDPC design for channels with high noise.

Ilya Dumer, Navid Gharavi

Proceedings of the IEEE Information Theory Workshop, 2021

Codes approaching the Shannon limit with polynomial complexity per information bit.

Ilya Dumer, Navid Gharavi

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Codes for high-noise memoryless channels.

Ilya Dumer, Navid Gharavi

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2018

Numerical and analytical bounds on threshold error rates for hypergraph-product codes.

Alexey A. Kovalev, Sanjay Prabhakar, Ilya Dumer, Leonid P. Pryadko

CoRR, 2018

2017

Distance Verification for Classical and Quantum LDPC Codes.

Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko

IEEE Trans. Inf. Theory, 2017

Spherically Punctured Reed-Muller Codes.

Ilya Dumer, Olga Kapralova

IEEE Trans. Inf. Theory, 2017

Recursive List Decoding for Reed-Muller Codes.

Ilya Dumer, Kirill Shabunov

CoRR, 2017

Recursive constructions and their maximum likelihood decoding.

Ilya Dumer, Kirill Shabunov

CoRR, 2017

On decoding algorithms for polar codes.

Ilya Dumer

CoRR, 2017

Recursive decoding of Reed-Muller codes.

Ilya Dumer

CoRR, 2017

Polar codes with a stepped boundary.

Ilya Dumer

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Distance verification for LDPC codes.

Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Mixed polarized constructions.

Ilya Dumer

Int. J. Inf. Coding Theory, 2015

2014

Numerical techniques for finding the distances of quantum codes.

Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Spherically Punctured Biorthogonal Codes.

Ilya Dumer, Olga Kapralova

IEEE Trans. Inf. Theory, 2013

Linked-cluster technique for finding the distance of a quantum LDPC code.

Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

2011

Soft-decision list decoding of Reed-Muller codes with linear complexity.

Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Clustered bounded-distance decoding of codeword-stabilized quantum codes.

Yunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Error exponents for two soft-decision decoding algorithms of Reed-Muller codes.

Marat V. Burnashev, Ilya Dumer

IEEE Trans. Inf. Theory, 2009

Structured Error Recovery for Codeword-Stabilized Quantum Codes.

Yunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko

CoRR, 2009

Equal-Weight Fingerprinting Codes.

Ilya Dumer

Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008

List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity.

Ilya Dumer, Gregory A. Kabatiansky, Cédric Tavernier

IEEE Trans. Inf. Theory, 2008

On the Fingerprinting Capacity Under the Marking Assumption.

N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer

IEEE Trans. Inf. Theory, 2008

2007

List decoding of the first-order binary Reed-Muller codes.

Ilya Dumer, Gregory A. Kabatiansky, Cédric Tavernier

Probl. Inf. Transm., 2007

Covering Spheres with Spheres.

Ilya Dumer

Discret. Comput. Geom., 2007

Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes.

Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Soft-decision decoding of Reed-Muller codes: recursive lists.

Ilya Dumer, Kirill Shabunov

IEEE Trans. Inf. Theory, 2006

Soft-decision decoding of Reed-Muller codes: a simplified algorithm.

Ilya Dumer

IEEE Trans. Inf. Theory, 2006

Error Exponents for Recursive Decoding of Reed-Muller Codes on a Binary-Symmetric Channel.

Marat V. Burnashev, Ilya Dumer

IEEE Trans. Inf. Theory, 2006

Covering an ellipsoid with equal balls.

Ilya Dumer

J. Comb. Theory A, 2006

Recursive error correction for general Reed-Muller codes.

Ilya Dumer, Kirill Shabunov

Discret. Appl. Math., 2006

List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity.

Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Covering spheres and balls with smaller balls.

Ilya Dumer

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Error exponents for recursive decoding of Reed-Muller codes.

Marat V. Burnashev, Ilya Dumer

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces.

Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov

Electron. Notes Discret. Math., 2005

2004

Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance.

Sergey Yekhanin, Ilya Dumer

IEEE Trans. Inf. Theory, 2004

On coverings of ellipsoids in Euclidean spaces.

Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov

IEEE Trans. Inf. Theory, 2004

Recursive decoding and its performance for low-rate Reed-Muller codes.

Ilya Dumer

IEEE Trans. Inf. Theory, 2004

On the thinnest coverings of ellipsoids.

Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On polylogarithmic decoding complexity for reed-muller codes.

Ilya Dumer

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

On recursive decoding with sublinear complexity for Reed-Muller codes.

Ilya Dumer

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002

An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space.

Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov

Probl. Inf. Transm., 2002

Epsilon-entropy of an Ellipsoid in a Hamming Space.

Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov

Probl. Inf. Transm., 2002

2001

Soft-decision decoding using punctured codes.

Ilya Dumer

IEEE Trans. Inf. Theory, 2001

2000

oft-decision majority decoding of Reed-Muller codes.

Ilya Dumer, Rafail E. Krichevskiy

IEEE Trans. Inf. Theory, 2000

Ellipsoidal lists and maximum-likelihood decoding.

Ilya Dumer

IEEE Trans. Inf. Theory, 2000

1999

Sort-and-match algorithm for soft-decision decoding.

Ilya Dumer

IEEE Trans. Inf. Theory, 1999

Hardness of Approximating the Minimum Distance of a Linear Code

Ilya Dumer, Daniele Micciancio, Madhu Sudan

Electron. Colloquium Comput. Complex., 1999

1997

Correction to 'Suboptimal decoding of linear codes: Partition technique' [Nov 96 1971-1986].

Ilya Dumer

IEEE Trans. Inf. Theory, 1997

1996

Suboptimal decoding of linear codes: partition technique.

Ilya Dumer

IEEE Trans. Inf. Theory, 1996

1995

Nonbinary double-error-correcting codes designed by means of algebraic varieties.

Ilya Dumer

IEEE Trans. Inf. Theory, 1995

1993

Erasure Correction Performance of Linear Block Codes.

Ilya Dumer, Patrick Guy Farrell

Proceedings of the Algebraic Coding, 1993

1992

On computing the weight spectrum of cyclic codes.

Alexander Barg, Ilya Dumer

IEEE Trans. Inf. Theory, 1992

1991

On Nonbinary Codes with Fixed Distance.

Ilya Dumer

Proceedings of the Algebraic Coding, 1991