Vladimir S. Lebedev

Learn More
Phylogenetic analysis of supraspecies relationships in one of the most young and species rich group of myomorph rodents - subfamily Arvicolinae was carried out on the base of two nuclear genes. Results have shown that mole-voles - Ellobiusini, steppe voles - (Lagurini) and grey voles (Arvicolini) are sister groups. This divergence is the most late, third(More)
It is rather difficult to construct a system of gray voles of the tribe Microtini by a set of morphological and karyological characters because form generation is mosaic at these organization levels. The sequence of the mitochondrial cytochrome b gene was used to study the phylogenetic relationships and taxonomic position of the Central Asian subgenus(More)
A (w, r) cover-free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A binary (w, r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as a concept of key distribution patterns. In this paper, we develop a method of(More)
We consider two generalizations of group testing: threshold group testing (introduced by Damaschke [7]) and majority group testing (a further generalization , including threshold group testing and a model introduced by Lebedev [14]). We show that each separating code gives a nonadaptive strategy for threshold group testing for some parameters. This is a(More)
A famous problem in Coding Theory consists in finding good bounds for the maximal size M (n, t, q) of a terror correcting code over a q-ary alphabet Q = {0, 1,. .. , q − 1} with block length n. This code concept is suited for communication over a q-ary channel with input alphabet X = Q and output alphabet Y = Q, where a word of length n sent by the encoder(More)
We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained(More)