Vladimir Levenshtein

From MaRDI portal
Person:172216

Available identifiers

zbMath Open levenshtein.vladimir-iosifovichDBLP30/821WikidataQ560858 ScholiaQ560858MaRDI QIDQ172216

List of research outcomes





PublicationDate of PublicationType
Error graphs and the reconstruction of elements in groups2009-06-17Paper
Error-Correction Capability of Binary Linear Codes2008-12-21Paper
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction2008-12-21Paper
Reconstruction of a graph from 2-vicinities of its vertices2008-09-29Paper
Conflict-avoiding codes and cyclic triple systems2008-06-09Paper
A conjecture on the reconstruction of graphs from metric balls of their vertices2008-02-14Paper
Reconstruction of a graph from 2–vicinities of its vertices2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34247202007-03-05Paper
Reconstruction of permutations distorted by single transposition errors2007-02-07Paper
https://portal.mardi4nfdi.de/entity/Q54883882006-09-14Paper
Asymptotic efficiency of two-stage disjunctive testing2005-05-11Paper
Combinatorial problems motivated by comma‐free codes2004-08-06Paper
Hypercubic 4 and 5-designs from double-error-correcting BCH codes2003-07-01Paper
Application of cover-free codes and combinatorial designs to two-stage testing.2003-06-10Paper
A universal bound for a covering in regular posets and its application to pool testing2003-06-09Paper
Efficient reconstruction of sequences from their subsequences of supersequences2002-09-02Paper
Efficient reconstruction of sequences2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q42420132002-01-06Paper
Efficient two-stage group testing2001-10-15Paper
Reconstruction of objects from a minimum number of distorted patterns2001-02-13Paper
https://portal.mardi4nfdi.de/entity/Q45010092000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q38386992000-05-22Paper
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications2000-01-25Paper
Association schemes and coding theory1999-11-21Paper
New lower bounds on aperiodic crosscorrelation of binary codes1999-11-21Paper
Split orthogonal arrays and maximum independent resilient systems of functions1997-09-29Paper
On the information function of an error-correcting code1997-06-10Paper
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces1996-05-08Paper
Superimposed codes in the Hamming space1995-11-09Paper
Bounds on the minimum support weights1995-07-12Paper
On upper bounds for code distance and covering radius of designs in polynomial metric spaces1995-06-11Paper
Packing and decomposition problems for polynomial association schemes1994-08-28Paper
https://portal.mardi4nfdi.de/entity/Q42849751994-04-19Paper
https://portal.mardi4nfdi.de/entity/Q42795041994-02-17Paper
Designs as maximum codes in polynomial metric spaces1993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q33601241991-01-01Paper
Straight-line bound for the undetected error exponent1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36658011983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38873351980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38766101979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41940481978-01-01Paper
Maximal packing density of \(n\)-dimensional Euclidean space with equal balls1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40811121974-01-01Paper
On the minimal redundancy of binary error-correcting codes1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40633251971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40633261971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40630411970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56773931969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56049571968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40489811968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55835571967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56787791966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56756231966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55283291965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56787571965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55998341965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51816391965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56452851964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56859781964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55321571964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56012371964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55678851962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53285421961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53285411961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32727851960-01-01Paper

Research outcomes over time

This page was built for person: Vladimir Levenshtein