I. I. Dumer

Available identifiers

zbMath Open dumer.ilya-iMaRDI QIDQ920926

List of research outcomes

Publication	Date of Publication	Type
Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank	2019-09-09	Paper
Distance Verification for Classical and Quantum LDPC Codes	2017-09-21	Paper
Distance Verification for Classical and Quantum LDPC Codes	2017-08-25	Paper
Error Exponents for Two Soft-Decision Decoding Algorithms of Reed–Muller Codes	2017-08-08	Paper
Spherically Punctured Biorthogonal Codes	2017-06-08	Paper
Mixed polarized constructions	2016-04-22	Paper
Equal-Weight Fingerprinting Codes	2009-07-23	Paper
On the Fingerprinting Capacity Under the Marking Assumption	2009-02-24	Paper
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity	2009-02-24	Paper
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces	2009-01-22	Paper
Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes	2008-12-21	Paper
Soft-decision decoding of Reed-Muller codes: a simplified algorithm	2008-12-21	Paper
On Coverings of Ellipsoids in Euclidean Spaces	2008-12-21	Paper
Soft-decision decoding of Reed-Muller codes: recursive lists	2008-12-21	Paper
Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance	2008-12-21	Paper
Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel	2008-12-21	Paper
List decoding of the first-order binary Reed-Muller codes	2008-06-09	Paper
Covering spheres with spheres	2008-02-18	Paper
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces	2007-05-29	Paper
Covering an ellipsoid with equal balls	2006-12-07	Paper
Recursive error correction for general Reed--Muller codes	2006-04-28	Paper
Hardness of approximating the minimum distance of a linear code	2005-05-31	Paper
https://portal.mardi4nfdi.de/entity/Q4665043	2005-04-09	Paper
Epsilon-entropy of an ellipsoid in a Hamming space	2004-01-08	Paper
An optimization problem related to the computation of the epsilon-entropy of an ellipsoid in a Hamming space	2003-06-19	Paper
Soft-decision decoding using punctured codes	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4242030	2001-09-05	Paper
Sort-and-match algorithm for soft-decision decoding	2000-09-07	Paper
Soft-decision majority decoding of Reed-Muller codes	2000-09-07	Paper
Ellipsoidal lists and maximum-likelihood decoding	2000-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4500992	2000-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q4500993	2000-09-03	Paper
Suboptimal decoding of linear codes: partition technique	1997-04-27	Paper
Nonbinary double-error-correcting codes designed by means of algebraic varieties	1997-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q4886134	1996-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4276352	1994-01-27	Paper
On computing the weight spectrum of cyclic codes	1992-10-11	Paper
Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity	1990-01-01	Paper
Two decoding algorithms for linear codes	1989-01-01	Paper
Asymptotically optimal codes correcting memory defects of fixed multiplicity	1989-01-01	Paper
Nonbinary codes with distances 4, 5, and 6 of cardinality greater than the BCH codes	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3809721	1988-01-01	Paper
Concatenated decoding algorithm with incomplete inspection of code vectors	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3735627	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3905200	1981-01-01	Paper
Remarks on tactical configurations in codes	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4180267	1978-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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