Výsledky vyhledávání - "O V Sinyavsky"

Analysis and Recurrent Calculation of 8th Rank MBF of Maximal Types

Publikováno v: Computer Science and Information Technology. 8:13-23

This paper is a continuation of the study of monotone Boolean functions (MBFs) of maximal types using MBF partitioning into schemes. When factor out any of the variables out of the brackets, two MBFs are formed: left (in brackets) and right. It prove

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::269b9468fd0303732ee2a845a9236dfb
https://doi.org/10.13189/csit.2020.080102

Zobrazit plný text záznamu

Analysis and Recurrent Computation of MBF of the Maximum Types

Autor: V G Tkachenco, O V Sinyavsky

Publikováno v: Computer Science and Information Technology. 7:72-81

This manuscript is a continuation of the research of monotone Boolean functions (MBF), using the MBF partition into types. An interesting connection is observed between the intersection of the groups of MBF stabilizers of n-1 rank and the number of i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0fb6af53f84197b395c63eb0db82ec48
https://doi.org/10.13189/csit.2019.070303

Zobrazit plný text záznamu

Maximum MBF Types

Autor: V G Tkachenco, O V Sinyavsky

Publikováno v: Computer Science and Information Technology. 6:47-53

The classification of monotone Boolean functions (MBF) into types is given. The notion of the maximum type of MBF is introduced, and the shift-sum types are constructed. The matrices of type distribution by rank are constructed. Convenient algorithms

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::17d69c443a231684f186d7cd28af38f3
https://doi.org/10.13189/csit.2018.060401

Zobrazit plný text záznamu

Algebraic Objects of MBFs and Recursive Computation of the Dedekind Number

Autor: V G Tkachenco, O V Sinyavsky

Publikováno v: Computer Science and Information Technology. 5:140-147

In this article the whole set of n-1 rank Monotone Boolean Functions (MBFs) is divided into equivalence classes. It shows how the Dedekind number D(n) can be calculated by using this partition. Five formulas were found to calculate this number as wel

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b70cf9b212581baa93e344abea6c058b
https://doi.org/10.13189/csit.2017.050404

Zobrazit plný text záznamu

Blocks of Monotone Boolean Functions of Rank 5

Autor: O V Sinyavsky, V G Tkachenco

Publikováno v: Computer Science and Information Technology. 4:139-146

Based on the classification of monotone Boolean functions (MBFs) on the types and the method of building MBFs blocks, an analysis is conducted of the MBFs rank 5. Four matrixes for such MBFs are adduced. It is shown that there are 7581 MBFs rank 5, 2

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ca4d934a453cb81072f8b368e2a733c5
https://doi.org/10.13189/csit.2016.040402

Zobrazit plný text záznamu

Blocks of Monotone Boolean Functions

Autor: O V Sinyavsky, V G Tkachenco

Publikováno v: Computer Science and Information Technology. 4:72-78

This paper first proposed the method of constructing blocks of monotone Boolean functions (MBFs) is developed for classification and the analysis of these functions. Use of only nonisomorphic blocks considerably simplifies enumeration MBFs. Applicati

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::89cbf48d4e74569984e4ef0d813b6b79
https://doi.org/10.13189/csit.2016.040203

Zobrazit plný text záznamu

Recursive Construction of n-gonal Codes on the Basis of Block Design

Autor: V G Tkachenco, O V Sinyavsky

Publikováno v: Computer Science and Information Technology. 2:331-338

In the article are defined nonlinear n-gonal block codes. The methods of constructing n-gonal codes are considered. Suggest efficient universal recursive methods of constructing codes great length on the basis of block design for error-correcting cod

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a63701603768e0a65efbad50aa4d0331
https://doi.org/10.13189/csit.2014.020803

Zobrazit plný text záznamu

Construction of Cryptosystem on the Basis of Triangular Codes

Autor: V G Tkachenco, O V Sinyavsky

Publikováno v: Computer Science and Information Technology. 2:300-307

In this article the triangular codes found dependence of the power of these codes on the length of codewords in them. The methods of construction codes and some triangular propose an effective general method for constructing such codes based on monot

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::54239a8a1dfa6340c35954a354699798
https://doi.org/10.13189/csit.2014.020703

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání