Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
I. I. Dumer - MaRDI portal

I. I. Dumer

From MaRDI portal
(Redirected from Person:274525)
Person:920926

Available identifiers

zbMath Open dumer.ilya-iMaRDI QIDQ920926

List of research outcomes

PublicationDate of PublicationType
Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank2019-09-09Paper
Distance Verification for Classical and Quantum LDPC Codes2017-09-21Paper
Distance Verification for Classical and Quantum LDPC Codes2017-08-25Paper
Error Exponents for Two Soft-Decision Decoding Algorithms of Reed–Muller Codes2017-08-08Paper
Spherically Punctured Biorthogonal Codes2017-06-08Paper
Mixed polarized constructions2016-04-22Paper
Equal-Weight Fingerprinting Codes2009-07-23Paper
On the Fingerprinting Capacity Under the Marking Assumption2009-02-24Paper
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity2009-02-24Paper
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces2009-01-22Paper
Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes2008-12-21Paper
Soft-decision decoding of Reed-Muller codes: a simplified algorithm2008-12-21Paper
On Coverings of Ellipsoids in Euclidean Spaces2008-12-21Paper
Soft-decision decoding of Reed-Muller codes: recursive lists2008-12-21Paper
Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance2008-12-21Paper
Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel2008-12-21Paper
List decoding of the first-order binary Reed-Muller codes2008-06-09Paper
Covering spheres with spheres2008-02-18Paper
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces2007-05-29Paper
Covering an ellipsoid with equal balls2006-12-07Paper
Recursive error correction for general Reed--Muller codes2006-04-28Paper
Hardness of approximating the minimum distance of a linear code2005-05-31Paper
https://portal.mardi4nfdi.de/entity/Q46650432005-04-09Paper
Epsilon-entropy of an ellipsoid in a Hamming space2004-01-08Paper
An optimization problem related to the computation of the epsilon-entropy of an ellipsoid in a Hamming space2003-06-19Paper
Soft-decision decoding using punctured codes2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q42420302001-09-05Paper
Sort-and-match algorithm for soft-decision decoding2000-09-07Paper
Soft-decision majority decoding of Reed-Muller codes2000-09-07Paper
Ellipsoidal lists and maximum-likelihood decoding2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q45009922000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45009932000-09-03Paper
Suboptimal decoding of linear codes: partition technique1997-04-27Paper
Nonbinary double-error-correcting codes designed by means of algebraic varieties1997-04-09Paper
https://portal.mardi4nfdi.de/entity/Q48861341996-07-28Paper
https://portal.mardi4nfdi.de/entity/Q42763521994-01-27Paper
On computing the weight spectrum of cyclic codes1992-10-11Paper
Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity1990-01-01Paper
Two decoding algorithms for linear codes1989-01-01Paper
Asymptotically optimal codes correcting memory defects of fixed multiplicity1989-01-01Paper
Nonbinary codes with distances 4, 5, and 6 of cardinality greater than the BCH codes1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38097211988-01-01Paper
Concatenated decoding algorithm with incomplete inspection of code vectors1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37356271986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39052001981-01-01Paper
Remarks on tactical configurations in codes1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41802671978-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: I. I. Dumer