default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlya Dumer
Person information
- affiliation: University of California, Riverside, Department of Electrical and Computer Engineering, CA, USA
- affiliation (PhD 1981): Russian Academy Sciences, Institute Information Transmission Problems, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c25]Ilya Dumer
, Navid Gharavi:
Codes approaching the Shannon limit with polynomial complexity per information bit. ISIT 2021: 238-243- [c24]Ilya Dumer, Navid Gharavi:
Combined polar-LDPC design for channels with high noise. ITW 2021: 1-6 - [i17]Ilya Dumer, Navid Gharavi:
Codes approaching the Shannon limit with polynomial complexity per information bit. CoRR abs/2101.10145 (2021) - 2020
- [c23]Ilya Dumer, Navid Gharavi:
Codes for high-noise memoryless channels. ISITA 2020: 101-105
2010 – 2019
- 2018
- [i16]Alexey A. Kovalev, Sanjay Prabhakar, Ilya Dumer, Leonid P. Pryadko:
Numerical and analytical bounds on threshold error rates for hypergraph-product codes. CoRR abs/1804.01950 (2018) - 2017
- [j29]Ilya Dumer, Olga Kapralova:
Spherically Punctured Reed-Muller Codes. IEEE Trans. Inf. Theory 63(5): 2773-2780 (2017) - [j28]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance Verification for Classical and Quantum LDPC Codes. IEEE Trans. Inf. Theory 63(7): 4675-4686 (2017) - [c22]Ilya Dumer:
Polar codes with a stepped boundary. ISIT 2017: 2613-2617 - [i15]Ilya Dumer:
Polar codes with a stepped boundary. CoRR abs/1702.04886 (2017) - [i14]Ilya Dumer, Kirill Shabunov:
Recursive constructions and their maximum likelihood decoding. CoRR abs/1703.05302 (2017) - [i13]Ilya Dumer:
Recursive decoding of Reed-Muller codes. CoRR abs/1703.05303 (2017) - [i12]Ilya Dumer, Kirill Shabunov:
Recursive List Decoding for Reed-Muller Codes. CoRR abs/1703.05304 (2017) - [i11]Ilya Dumer, Kirill Shabunov:
Soft decision decoding of Reed-Muller codes: recursive lists. CoRR abs/1703.05305 (2017) - [i10]Ilya Dumer:
Recursive Decoding and Its Performance for Low-Rate Reed-Muller Codes. CoRR abs/1703.05306 (2017) - [i9]Ilya Dumer:
On decoding algorithms for polar codes. CoRR abs/1703.05307 (2017) - 2016
- [c21]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance verification for LDPC codes. ISIT 2016: 2529-2533 - [i8]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance verification for LDPC codes. CoRR abs/1605.02410 (2016) - [i7]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance verification for classical and quantum LDPC codes. CoRR abs/1611.07164 (2016) - 2015
- [j27]Ilya Dumer:
Mixed polarized constructions. Int. J. Inf. Coding Theory 3(2): 97-106 (2015) - 2014
- [c20]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Numerical techniques for finding the distances of quantum codes. ISIT 2014: 1086-1090 - [i6]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Numerical Techniques for Finding the Distances of Quantum Codes. CoRR abs/1405.0348 (2014) - 2013
- [j26]Ilya Dumer, Olga Kapralova:
Spherically Punctured Biorthogonal Codes. IEEE Trans. Inf. Theory 59(9): 6010-6017 (2013) - [c19]Olga Kapralova, Ilya Dumer:
Spherically punctured Reed-Muller codes. ISIT 2013: 1047-1051 - [c18]Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko:
Linked-cluster technique for finding the distance of a quantum LDPC code. ITA 2013: 1-6 - [i5]Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko:
Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code. CoRR abs/1302.1845 (2013) - 2012
- [c17]Ilya Dumer, Olga Kapralova:
Spherically punctured biorthogonal codes. ISIT 2012: 259-263 - 2011
- [c16]Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier:
Soft-decision list decoding of Reed-Muller codes with linear complexity. ISIT 2011: 2303-2307 - 2010
- [c15]Yunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko:
Clustered bounded-distance decoding of codeword-stabilized quantum codes. ISIT 2010: 2662-2666
2000 – 2009
- 2009
- [j25]Marat V. Burnashev, Ilya Dumer:
Error exponents for two soft-decision decoding algorithms of Reed-Muller codes. IEEE Trans. Inf. Theory 55(9): 4108-4118 (2009) - [c14]Ilya Dumer:
Equal-Weight Fingerprinting Codes. IWCC 2009: 43-51 - [i4]Yunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko:
Structured Error Recovery for Codeword-Stabilized Quantum Codes. CoRR abs/0912.3245 (2009) - 2008
- [j24]N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption. IEEE Trans. Inf. Theory 54(6): 2678-2689 (2008) - [j23]Ilya Dumer, Gregory A. Kabatiansky, Cédric Tavernier:
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity. IEEE Trans. Inf. Theory 54(10): 4488-4492 (2008) - [c13]Marat V. Burnashev, Ilya Dumer:
Error exponents for two soft decision decoding algorithms of Reed-Muller codes. ISIT 2008: 71-75 - 2007
- [j22]Ilya Dumer:
Covering Spheres with Spheres. Discret. Comput. Geom. 38(4): 665-679 (2007) - [j21]Ilya Dumer, Gregory A. Kabatiansky, Cédric Tavernier:
List decoding of the first-order binary Reed-Muller codes. Probl. Inf. Transm. 43(3): 225-232 (2007) - [c12]N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer:
Fingerprinting Capacity Under the Marking Assumption. ISIT 2007: 706-710 - [c11]Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier:
Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes. ISIT 2007: 1346-1349 - 2006
- [j20]Ilya Dumer, Kirill Shabunov:
Recursive error correction for general Reed-Muller codes. Discret. Appl. Math. 154(2): 253-269 (2006) - [j19]Ilya Dumer:
Covering an ellipsoid with equal balls. J. Comb. Theory A 113(8): 1667-1676 (2006) - [j18]Ilya Dumer:
Soft-decision decoding of Reed-Muller codes: a simplified algorithm. IEEE Trans. Inf. Theory 52(3): 954-963 (2006) - [j17]Ilya Dumer, Kirill Shabunov:
Soft-decision decoding of Reed-Muller codes: recursive lists. IEEE Trans. Inf. Theory 52(3): 1260-1266 (2006) - [j16]Marat V. Burnashev, Ilya Dumer:
Error Exponents for Recursive Decoding of Reed-Muller Codes on a Binary-Symmetric Channel. IEEE Trans. Inf. Theory 52(11): 4880-4891 (2006) - [c10]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 - [c9]Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier:
List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity. ISIT 2006: 138-142 - [c8]Marat V. Burnashev, Ilya Dumer:
Error exponents for recursive decoding of Reed-Muller codes. ISIT 2006: 704-708 - [c7]Ilya Dumer:
Covering spheres and balls with smaller balls. ISIT 2006: 992-996 - [i3]N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption. CoRR abs/cs/0612073 (2006) - 2005
- [j15]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces. Electron. Notes Discret. Math. 21: 277 (2005) - 2004
- [j14]Ilya Dumer:
Recursive decoding and its performance for low-rate Reed-Muller codes. IEEE Trans. Inf. Theory 50(5): 811-823 (2004) - [j13]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On coverings of ellipsoids in Euclidean spaces. IEEE Trans. Inf. Theory 50(10): 2348-2356 (2004) - [j12]Sergey Yekhanin, Ilya Dumer:
Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. IEEE Trans. Inf. Theory 50(10): 2357-2362 (2004) - [c6]Ilya Dumer:
On polylogarithmic decoding complexity for reed-muller codes. ISIT 2004: 326 - [c5]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On the thinnest coverings of ellipsoids. ISIT 2004: 521 - [i2]Sergey Yekhanin, Ilya Dumer:
Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance. CoRR cs.IT/0406039 (2004) - 2003
- [j11]Ilya Dumer, Daniele Micciancio, Madhu Sudan:
Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inf. Theory 49(1): 22-37 (2003) - [c4]Ilya Dumer:
On recursive decoding with sublinear complexity for Reed-Muller codes. ITW 2003: 14-17 - 2002
- [j10]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(1): 1-15 (2002) - [j9]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(2): 99-112 (2002) - 2001
- [j8]Ilya Dumer:
Soft-decision decoding using punctured codes. IEEE Trans. Inf. Theory 47(1): 59-71 (2001) - 2000
- [j7]Ilya Dumer, Rafail E. Krichevskiy:
oft-decision majority decoding of Reed-Muller codes. IEEE Trans. Inf. Theory 46(1): 258-264 (2000) - [j6]Ilya Dumer:
Ellipsoidal lists and maximum-likelihood decoding. IEEE Trans. Inf. Theory 46(2): 649-656 (2000)
1990 – 1999
- 1999
- [j5]Ilya Dumer:
Sort-and-match algorithm for soft-decision decoding. IEEE Trans. Inf. Theory 45(7): 2333-2338 (1999) - [c3]Ilya Dumer, Daniele Micciancio, Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code. FOCS 1999: 475-485 - [i1]Ilya Dumer, Daniele Micciancio, Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code. Electron. Colloquium Comput. Complex. TR99 (1999) - 1997
- [j4]Ilya Dumer:
Correction to 'Suboptimal decoding of linear codes: Partition technique' [Nov 96 1971-1986]. IEEE Trans. Inf. Theory 43(2): 792 (1997) - 1996
- [j3]Ilya Dumer:
Suboptimal decoding of linear codes: partition technique. IEEE Trans. Inf. Theory 42(6): 1971-1986 (1996) - 1995
- [j2]Ilya Dumer:
Nonbinary double-error-correcting codes designed by means of algebraic varieties. IEEE Trans. Inf. Theory 41(6): 1657-1666 (1995) - 1993
- [c2]Ilya Dumer, Patrick Guy Farrell:
Erasure Correction Performance of Linear Block Codes. Algebraic Coding 1993: 316-326 - 1992
- [j1]Alexander Barg, Ilya Dumer:
On computing the weight spectrum of cyclic codes. IEEE Trans. Inf. Theory 38(4): 1382-1386 (1992) - 1991
- [c1]Ilya Dumer:
On Nonbinary Codes with Fixed Distance. Algebraic Coding 1991: 67-74
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
