The following pages link to I. I. Dumer (Q920926):
Displaying 48 items.
- (Q274525) (redirect page) (← links)
- Mixed polarized constructions (Q274527) (← links)
- Covering an ellipsoid with equal balls (Q855867) (← links)
- Two decoding algorithms for linear codes (Q920927) (← links)
- Asymptotically optimal codes correcting memory defects of fixed multiplicity (Q923061) (← links)
- List decoding of the first-order binary Reed-Muller codes (Q927477) (← links)
- Concatenated decoding algorithm with incomplete inspection of code vectors (Q1090662) (← links)
- Nonbinary codes with distances 4, 5, and 6 of cardinality greater than the BCH codes (Q1122554) (← links)
- Remarks on tactical configurations in codes (Q1156768) (← links)
- Epsilon-entropy of an ellipsoid in a Hamming space (Q1812332) (← links)
- An optimization problem related to the computation of the epsilon-entropy of an ellipsoid in a Hamming space (Q1812349) (← links)
- Covering spheres with spheres (Q2471717) (← links)
- Recursive error correction for general Reed--Muller codes (Q2489920) (← links)
- Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity (Q2640571) (← links)
- Suboptimal decoding of linear codes: partition technique (Q3129481) (← links)
- On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces (Q3439263) (← links)
- Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes (Q3546822) (← links)
- Soft-decision decoding of Reed-Muller codes: a simplified algorithm (Q3546823) (← links)
- On Coverings of Ellipsoids in Euclidean Spaces (Q3546824) (← links)
- Soft-decision decoding of Reed-Muller codes: recursive lists (Q3546825) (← links)
- Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance (Q3547854) (← links)
- Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel (Q3547990) (← links)
- On the Fingerprinting Capacity Under the Marking Assumption (Q3604735) (← links)
- List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity (Q3604930) (← links)
- (Q3735627) (← links)
- (Q3809721) (← links)
- (Q3905200) (← links)
- On computing the weight spectrum of cyclic codes (Q4014158) (← links)
- (Q4180267) (← links)
- (Q4242030) (← links)
- (Q4276352) (← links)
- (Q4500992) (← links)
- (Q4500993) (← links)
- Sort-and-match algorithm for soft-decision decoding (Q4503456) (← links)
- Soft-decision majority decoding of Reed-Muller codes (Q4503510) (← links)
- Ellipsoidal lists and maximum-likelihood decoding (Q4503532) (← links)
- Soft-decision decoding using punctured codes (Q4544454) (← links)
- (Q4665043) (← links)
- Hardness of approximating the minimum distance of a linear code (Q4679877) (← links)
- Nonbinary double-error-correcting codes designed by means of algebraic varieties (Q4880288) (← links)
- (Q4886134) (← links)
- Error Exponents for Two Soft-Decision Decoding Algorithms of Reed–Muller Codes (Q4973978) (← links)
- Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank (Q5193193) (← links)
- Equal-Weight Fingerprinting Codes (Q5322997) (← links)
- Spherically Punctured Biorthogonal Codes (Q5346343) (← links)
- Distance Verification for Classical and Quantum LDPC Codes (Q5347951) (← links)
- Distance Verification for Classical and Quantum LDPC Codes (Q5358595) (← links)
- On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces (Q5504234) (← links)