The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ilya Dumer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Equal-Weight Fingerprinting Codes. [Citation Graph (, )][DBLP]


  26. Covering Spheres with Spheres. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002