| 2008 |
|---|
| 28 | EE | Ilya Dumer,
Gregory A. Kabatiansky,
Cédric Tavernier:
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity.
IEEE Transactions on Information Theory 54(10): 4488-4492 (2008) |
| 27 | EE | N. Prasanth Anthapadmanabhan,
Alexander Barg,
Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption.
IEEE Transactions on Information Theory 54(6): 2678-2689 (2008) |
| 2007 |
|---|
| 26 | EE | Ilya Dumer:
Covering Spheres with Spheres.
Discrete & Computational Geometry 38(4): 665-679 (2007) |
| 2006 |
|---|
| 25 | EE | Ilya Dumer,
Mark S. Pinsker,
Vyacheslav V. Prelov:
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces.
GTIT-C 2006: 898-925 |
| 24 | EE | N. Prasanth Anthapadmanabhan,
Alexander Barg,
Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption
CoRR abs/cs/0612073: (2006) |
| 23 | EE | Ilya Dumer,
Kirill Shabunov:
Recursive error correction for general Reed-Muller codes.
Discrete Applied Mathematics 154(2): 253-269 (2006) |
| 22 | EE | M. Burnashev,
Ilya Dumer:
Error Exponents for Recursive Decoding of Reed-Muller Codes on a Binary-Symmetric Channel.
IEEE Transactions on Information Theory 52(11): 4880-4891 (2006) |
| 21 | EE | Ilya Dumer,
Kirill Shabunov:
Soft-decision decoding of Reed-Muller codes: recursive lists.
IEEE Transactions on Information Theory 52(3): 1260-1266 (2006) |
| 20 | EE | Ilya Dumer:
Soft-decision decoding of Reed-Muller codes: a simplified algorithm.
IEEE Transactions on Information Theory 52(3): 954-963 (2006) |
| 19 | EE | Ilya Dumer:
Covering an ellipsoid with equal balls.
J. Comb. Theory, Ser. A 113(8): 1667-1676 (2006) |
| 2005 |
|---|
| 18 | EE | Ilya Dumer,
Mark S. Pinsker,
Vyacheslav V. Prelov:
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces.
Electronic Notes in Discrete Mathematics 21: 277 (2005) |
| 2004 |
|---|
| 17 | EE | Sergey Yekhanin,
Ilya Dumer:
Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance
CoRR cs.IT/0406039: (2004) |
| 16 | | Ilya Dumer,
Mark S. Pinsker,
Vyacheslav V. Prelov:
On coverings of ellipsoids in Euclidean spaces.
IEEE Transactions on Information Theory 50(10): 2348-2356 (2004) |
| 15 | | Sergey Yekhanin,
Ilya Dumer:
Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance.
IEEE Transactions on Information Theory 50(10): 2357-2362 (2004) |
| 14 | | Ilya Dumer:
Recursive decoding and its performance for low-rate Reed-Muller codes.
IEEE Transactions on Information Theory 50(5): 811-823 (2004) |
| 2003 |
|---|
| 13 | | Ilya Dumer,
Daniele Micciancio,
Madhu Sudan:
Hardness of approximating the minimum distance of a linear code.
IEEE Transactions on Information Theory 49(1): 22-37 (2003) |
| 2001 |
|---|
| 12 | | Ilya Dumer:
Soft-decision decoding using punctured codes.
IEEE Transactions on Information Theory 47(1): 59-71 (2001) |
| 2000 |
|---|
| 11 | | Ilya Dumer,
Rafail E. Krichevskiy:
oft-decision majority decoding of Reed-Muller codes.
IEEE Transactions on Information Theory 46(1): 258-264 (2000) |
| 10 | | Ilya Dumer:
Ellipsoidal lists and maximum-likelihood decoding.
IEEE Transactions on Information Theory 46(2): 649-656 (2000) |
| 1999 |
|---|
| 9 | EE | Ilya Dumer,
Daniele Micciancio,
Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code.
FOCS 1999: 475-485 |
| 8 | EE | Ilya Dumer,
Daniele Micciancio,
Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code
Electronic Colloquium on Computational Complexity (ECCC) 6(29): (1999) |
| 7 | | Ilya Dumer:
Sort-and-match algorithm for soft-decision decoding.
IEEE Transactions on Information Theory 45(7): 2333-2338 (1999) |
| 1997 |
|---|
| 6 | | Ilya Dumer:
Correction to 'Suboptimal decoding of linear codes: Partition technique' [Nov 96 1971-1986].
IEEE Transactions on Information Theory 43(2): 792 (1997) |
| 1996 |
|---|
| 5 | | Ilya Dumer:
Suboptimal decoding of linear codes: partition technique.
IEEE Transactions on Information Theory 42(6): 1971-1986 (1996) |
| 1995 |
|---|
| 4 | | Ilya Dumer:
Nonbinary double-error-correcting codes designed by means of algebraic varieties.
IEEE Transactions on Information Theory 41(6): 1657-1666 (1995) |
| 1993 |
|---|
| 3 | | Ilya Dumer,
Patrick G. Farrell:
Erasure Correction Performance of Linear Block Codes.
Algebraic Coding 1993: 316-326 |
| 1992 |
|---|
| 2 | | Alexander Barg,
Ilya Dumer:
On computing the weight spectrum of cyclic codes.
IEEE Transactions on Information Theory 38(4): 1382- (1992) |
| 1991 |
|---|
| 1 | | Ilya Dumer:
On Nonbinary Codes with Fixed Distance.
Algebraic Coding 1991: 67-74 |
