The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vladimir I. Levenshtein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vladimir I. Levenshtein
    Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:25-42 [Conf]
  2. Toby Berger, Vladimir I. Levenshtein
    Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:11-26 [Journal]
  3. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:3, pp:265-282 [Journal]
  4. Vladimir I. Levenshtein
    Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:12, n:2, pp:131-160 [Journal]
  5. Vladimir I. Levenshtein
    A universal bound for a covering in regular posets and its application to pool testing. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:293-309 [Journal]
  6. Vladimir I. Levenshtein
    Packing and Decomposition Problems for Polynomial Association Schemes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:5, pp:461-477 [Journal]
  7. Vladimir I. Levenshtein
    On the Minimal Redundancy of Binary Error-Correcting Codes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:28, n:4, pp:268-291 [Journal]
  8. G. Fazekas, Vladimir I. Levenshtein
    On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:70, n:2, pp:267-288 [Journal]
  9. Vladimir I. Levenshtein
    Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:93, n:2, pp:310-332 [Journal]
  10. Toby Berger, Vladimir I. Levenshtein
    Asymptotic efficiency of two-stage disjunctive testing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:1741-1749 [Journal]
  11. Philippe Delsarte, Vladimir I. Levenshtein
    Association Schemes and Coding Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2477-2504 [Journal]
  12. Thomas H. E. Ericson, Vladimir I. Levenshtein
    Superimposed codes in the Hamming space. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1882-1893 [Journal]
  13. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2818-2823 [Journal]
  14. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    Error-correction capability of binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:4, pp:1408-1423 [Journal]
  15. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    On the information function of an error-correcting code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:549-557 [Journal]
  16. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus
    Bounds on the minimum support weights. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:432-440 [Journal]
  17. Vladimir I. Levenshtein
    Efficient reconstruction of sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:2-22 [Journal]
  18. Vladimir I. Levenshtein
    Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:5, pp:1303-1321 [Journal]
  19. Vladimir I. Levenshtein
    New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:284-288 [Journal]
  20. Vladimir I. Levenshtein, A. J. Han Vinck
    Perfect (d, k)-codes capable of correcting single peak-shifts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:656-0 [Journal]
  21. Vladimir I. Levenshtein
    On designs in compact metric spaces and a universal bound on their size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:192, n:1-3, pp:251-271 [Journal]
  22. Vladimir I. Levenshtein
    Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:515-536 [Journal]

  23. 06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. [Citation Graph (, )][DBLP]


  24. 06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. [Citation Graph (, )][DBLP]


  25. Reconstruction of a graph from 2-vicinities of its vertices. [Citation Graph (, )][DBLP]


  26. A conjecture on the reconstruction of graphs from metric balls of their vertices. [Citation Graph (, )][DBLP]


Search in 0.031secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002