|
Web Library Publication Searh | Русский |
Publications |
Levenshtein V. I. |
2003 year |
1. |
Publisher:
Authors: , Title: Application of cover-free codes and combinatorial designs to two-stage testing |
2003 year |
2. |
Publisher:
Authors: , , Title: Hypercubic 4 and 5-designs from double-error-correcting BCH codes |
2003 year |
3. |
Publisher:
Authors: Title: A universal bound for a covering in regular posets and its application to pool testing |
2003 year |
4. |
Publisher:
Authors: Title: Combinatorial problems motivated by comma-free codes |
2002 year |
5. |
Publisher:
Authors: , Title: Asymptotical efficiency of two-stage testing |
2001 year |
6. |
Publisher:
Authors: Title: Efficient reconstruction of seguences |
2001 year |
7. |
Publisher:
Authors: Title: Efficient reconstruction of sequences from their subsequences or supersequences |
1999 year |
8. |
Publisher:
Authors: Title: Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes and some applications |
1999 year |
9. |
Publisher:
Authors: Title: New lower bounds on aperiodic crosscorrelation of binary codes |
1998 year |
10. |
Publisher:
Authors: Title: Universal bounds for codes and designs, in Handbook of Coding Theory |
1998 year |
11. |
Publisher:
Authors: , Title: Association schemes and coding theory |
1998 year |
12. |
Publisher:
Authors: Title: On designs in compact metric spaces and a universal bound on their size |
1997 year |
13. |
Publisher:
Authors: Title: Split ortogonal arrays and maximum independent resilient systems of functions |