Zobrazeno 1 - 10
of 206
pro vyhledávání: '"S. Encheva"'
Publikováno v:
Petrology. 27:186-201
Liquid immiscibility was studied in melting experiments in the system trachyrhyolite–water + salt (NaF, Na2CO3) conducted at parameters imitating those of the volcanic process. The indicator components were La, Nb, Sr, W, Mo, Cr, Fe, Rb, and Cs. Th
Autor:
Dmitriy I. Belakovskiy, S. Encheva, Igor V. Pekov, Sergey N. Britvin, P. Petrov, Nikita V. Chukanov, Sergey M. Aksenov
Publikováno v:
Geology of Ore Deposits. 58:666-673
Dachiardite-K (IMA No. 2015-041), a new zeolite, is a K-dominant member of the dachiardite series with the idealized formula (К2Са)(Al4Si20O48) · 13H2О. It occurs in the walls of opal–chalcedony veinlets cutting hydrothermally altered effusive
Autor:
S. Encheva
Publikováno v:
Proceedings of the 2015 International Conference on Electrical, Automation and Mechanical Engineering.
Autor:
S. Encheva
Publikováno v:
Proceedings of the International Conference on Computer Information Systems and Industrial Applications.
Learners’ preferences play significant role in effectiveness of a study process. Individual preferences and group preferences however may differ considerably. While data is collected from single users, general settings are usually made to serve gro
Autor:
S. Encheva
Publikováno v:
Proceedings of the 2015 International Conference on Electrical, Automation and Mechanical Engineering.
Autor:
S. Encheva
Publikováno v:
Proceedings of the International Conference on Computer Information Systems and Industrial Applications.
Autor:
Torleiv Kløve, S. Encheva
Publikováno v:
IEEE Transactions on Information Theory. 40:175-180
The authors considered weight hierarchies of codes satisfying the chain condition, they called these chain-good. First, they gave a set of simple necessary conditions for a sequence to be chain-good. They proved that given one chain-good sequence, th
Autor:
S. Encheva, G. Cohen
Publikováno v:
1998 Information Theory Workshop (Cat. No.98EX131).
We survey the last developments in the area of covering radius and illustrate the concept with applications to telecommunication problems. We discuss a few generalizations and open problems. We deal mostly with binary linear codes.
Autor:
S. Encheva, G. Cohen
Publikováno v:
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
If C is a code of length n over a p-ary alphabet, then x is called a descendant of the code-words a,b,...,e if x/sub i/ /spl isin/{a/sub i/,b/sub i/,...,e/sub i/} for i=1,...,n. We study codes with the following property: the descendant of any coalit
Publikováno v:
Discrete Applied Mathematics. 131(3):689-690