Ilya Dumer

According to our database1, Ilya Dumer authored at least 52 papers between 1991 and 2021.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2007, "For contributions to error-correcting codes".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

2017
Distance Verification for Classical and Quantum LDPC Codes.
IEEE Trans. Inf. Theory, 2017

Spherically Punctured Reed-Muller Codes.
IEEE Trans. Inf. Theory, 2017

Recursive List Decoding for Reed-Muller Codes.
CoRR, 2017

Recursive constructions and their maximum likelihood decoding.
CoRR, 2017

On decoding algorithms for polar codes.
CoRR, 2017

Recursive decoding of Reed-Muller codes.
CoRR, 2017

Polar codes with a stepped boundary.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Distance verification for LDPC codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Mixed polarized constructions.
Int. J. Inf. Coding Theory, 2015

2014
Numerical techniques for finding the distances of quantum codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Spherically Punctured Biorthogonal Codes.
IEEE Trans. Inf. Theory, 2013

Linked-cluster technique for finding the distance of a quantum LDPC code.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

2011
Soft-decision list decoding of Reed-Muller codes with linear complexity.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Clustered bounded-distance decoding of codeword-stabilized quantum codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Error exponents for two soft-decision decoding algorithms of Reed-Muller codes.
IEEE Trans. Inf. Theory, 2009

Structured Error Recovery for Codeword-Stabilized Quantum Codes.
CoRR, 2009

Equal-Weight Fingerprinting Codes.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity.
IEEE Trans. Inf. Theory, 2008

On the Fingerprinting Capacity Under the Marking Assumption.
IEEE Trans. Inf. Theory, 2008

2007
List decoding of the first-order binary Reed-Muller codes.
Probl. Inf. Transm., 2007

Covering Spheres with Spheres.
Discret. Comput. Geom., 2007

Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Soft-decision decoding of Reed-Muller codes: recursive lists.
IEEE Trans. Inf. Theory, 2006

Soft-decision decoding of Reed-Muller codes: a simplified algorithm.
IEEE Trans. Inf. Theory, 2006

Error Exponents for Recursive Decoding of Reed-Muller Codes on a Binary-Symmetric Channel.
IEEE Trans. Inf. Theory, 2006

Covering an ellipsoid with equal balls.
J. Comb. Theory, Ser. A, 2006

Recursive error correction for general Reed-Muller codes.
Discret. Appl. Math., 2006

List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Covering spheres and balls with smaller balls.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Error exponents for recursive decoding of Reed-Muller codes.
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.
Electron. Notes Discret. Math., 2005

2004
Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance.
IEEE Trans. Inf. Theory, 2004

On coverings of ellipsoids in Euclidean spaces.
IEEE Trans. Inf. Theory, 2004

Recursive decoding and its performance for low-rate Reed-Muller codes.
IEEE Trans. Inf. Theory, 2004

On the thinnest coverings of ellipsoids.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On polylogarithmic decoding complexity for reed-muller codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On recursive decoding with sublinear complexity for Reed-Muller codes.
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.
Probl. Inf. Transm., 2002

Epsilon-entropy of an Ellipsoid in a Hamming Space.
Probl. Inf. Transm., 2002

2001
Soft-decision decoding using punctured codes.
IEEE Trans. Inf. Theory, 2001

2000
oft-decision majority decoding of Reed-Muller codes.
IEEE Trans. Inf. Theory, 2000

Ellipsoidal lists and maximum-likelihood decoding.
IEEE Trans. Inf. Theory, 2000

1999
Sort-and-match algorithm for soft-decision decoding.
IEEE Trans. Inf. Theory, 1999

Hardness of Approximating the Minimum Distance of a Linear Code
Electron. Colloquium Comput. Complex., 1999

1997
Correction to 'Suboptimal decoding of linear codes: Partition technique' [Nov 96 1971-1986].
IEEE Trans. Inf. Theory, 1997

1996
Suboptimal decoding of linear codes: partition technique.
IEEE Trans. Inf. Theory, 1996

1995
Nonbinary double-error-correcting codes designed by means of algebraic varieties.
IEEE Trans. Inf. Theory, 1995

1993
Erasure Correction Performance of Linear Block Codes.
Proceedings of the Algebraic Coding, 1993

1992
On computing the weight spectrum of cyclic codes.
IEEE Trans. Inf. Theory, 1992

1991
On Nonbinary Codes with Fixed Distance.
Proceedings of the Algebraic Coding, 1991


  Loading...