The following pages link to Vladimir I. Levenshtein (Q172216):
Displaying 50 items.
- (Q920933) (redirect page) (← links)
- Straight-line bound for the undetected error exponent (Q920934) (← links)
- Conflict-avoiding codes and cyclic triple systems (Q927474) (← links)
- (Q947078) (redirect page) (← links)
- Reconstruction of a graph from 2-vicinities of its vertices (Q947081) (← links)
- Error graphs and the reconstruction of elements in groups (Q1024341) (← links)
- (Q1201907) (redirect page) (← links)
- Designs as maximum codes in polynomial metric spaces (Q1201908) (← links)
- Maximal packing density of \(n\)-dimensional Euclidean space with equal balls (Q1221392) (← links)
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications (Q1292857) (← links)
- Packing and decomposition problems for polynomial association schemes (Q1322412) (← links)
- Split orthogonal arrays and maximum independent resilient systems of functions (Q1368733) (← links)
- Hypercubic 4 and 5-designs from double-error-correcting BCH codes (Q1395765) (← links)
- Reconstruction of objects from a minimum number of distorted patterns (Q1595609) (← links)
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056) (← links)
- A universal bound for a covering in regular posets and its application to pool testing (Q1810653) (← links)
- Application of cover-free codes and combinatorial designs to two-stage testing. (Q1811089) (← links)
- A conjecture on the reconstruction of graphs from metric balls of their vertices (Q2470472) (← links)
- (Q2741447) (← links)
- (Q3272785) (← links)
- (Q3360124) (← links)
- (Q3424720) (← links)
- Reconstruction of a graph from 2–vicinities of its vertices (Q3439285) (← links)
- The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction (Q3546992) (← links)
- Error-Correction Capability of Binary Linear Codes (Q3546994) (← links)
- (Q3665801) (← links)
- (Q3838699) (← links)
- (Q3876610) (← links)
- (Q3887335) (← links)
- (Q4048981) (← links)
- (Q4063041) (← links)
- (Q4063325) (← links)
- (Q4063326) (← links)
- On the minimal redundancy of binary error-correcting codes (Q4077874) (← links)
- (Q4081112) (← links)
- (Q4194048) (← links)
- (Q4242013) (← links)
- (Q4279504) (← links)
- (Q4284975) (← links)
- On the information function of an error-correcting code (Q4340324) (← links)
- (Q4501009) (← links)
- Efficient reconstruction of sequences (Q4544450) (← links)
- Asymptotic efficiency of two-stage disjunctive testing (Q4674541) (← links)
- Association schemes and coding theory (Q4701199) (← links)
- New lower bounds on aperiodic crosscorrelation of binary codes (Q4701271) (← links)
- Combinatorial problems motivated by comma‐free codes (Q4736762) (← links)
- Bounds on the minimum support weights (Q4838668) (← links)
- Superimposed codes in the Hamming space (Q4850289) (← links)
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces (Q4859756) (← links)
- (Q5181639) (← links)
