# Ilya Dumer

According to our database

Collaborative distances:

^{1}, 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

IEEE Trans. Inf. Theory, 2017

IEEE Trans. Inf. Theory, 2017

CoRR, 2017

CoRR, 2017

CoRR, 2017

CoRR, 2017

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

2016

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Int. J. Inf. Coding Theory, 2015

2014

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

2013

IEEE Trans. Inf. Theory, 2013

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

2011

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

2010

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

IEEE Trans. Inf. Theory, 2009

CoRR, 2009

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

IEEE Trans. Inf. Theory, 2008

2007

Probl. Inf. Transm., 2007

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

IEEE Trans. Inf. Theory, 2006

IEEE Trans. Inf. Theory, 2006

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

IEEE Trans. Inf. Theory, 2006

J. Comb. Theory, Ser. A, 2006

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

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

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

IEEE Trans. Inf. Theory, 2004

IEEE Trans. Inf. Theory, 2004

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

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

2003

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

Probl. Inf. Transm., 2002

2001

IEEE Trans. Inf. Theory, 2001

2000

IEEE Trans. Inf. Theory, 2000

IEEE Trans. Inf. Theory, 2000

1999

IEEE Trans. Inf. Theory, 1999

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

IEEE Trans. Inf. Theory, 1996

1995

IEEE Trans. Inf. Theory, 1995

1993

Proceedings of the Algebraic Coding, 1993

1992

IEEE Trans. Inf. Theory, 1992

1991

Proceedings of the Algebraic Coding, 1991