Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Valentin Bakoev"'
Publikováno v:
Algorithms, Vol 17, Iss 7, p 311 (2024)
In this work, we systematize several implementations of the Gray code over an alphabet with m≥2 elements, which we present in C code so that they can be used directly after copying from the text. We consider two variants—reflected and modular (or
Externí odkaz:
https://doaj.org/article/171e9f0aee06433e92d4a0bcf85ed740
Publikováno v:
Mathematics, Vol 11, Iss 24, p 4950 (2023)
Binary codes have a special place in coding theory since they are one of the most commonly used in practice. There are classes of codes specific only to the binary case. One such class is self-complementary codes. Self-complementary linear codes are
Externí odkaz:
https://doaj.org/article/a652407698b5498a986ccca3c9ab6131
Autor:
Valentin Bakoev
Publikováno v:
Algebraic Informatics ISBN: 9783031196843
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdc895f4704af5e280146fd58d0031a7
https://doi.org/10.1007/978-3-031-19685-0_4
https://doi.org/10.1007/978-3-031-19685-0_4
Autor:
Valentin Bakoev
Publikováno v:
Valentin Bakoev
Knowledge on the enumeration and distribution of Boolean functions according to their algebraic degrees is important for the theory as well as for its applications. As of now, this knowledge is not complete; for example, it is well-known that half of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f305b412b6e9b951bc0c9a7cac32f87d
https://doi.org/10.55630/sjc.2019.13.17-26
https://doi.org/10.55630/sjc.2019.13.17-26
Autor:
Valentin Bakoev
Publikováno v:
CompSysTech
The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important cryptographic parameter that should be computed by fast algorithms. They work in two main ways: (1) by computing the algebraic normal form and then searching t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::706c908dbd610c9da058dcc1ac997b39
https://doi.org/10.1145/3407982.3408005
https://doi.org/10.1145/3407982.3408005
Autor:
Valentin Bakoev
Publikováno v:
Algebraic Informatics ISBN: 9783030213626
CAI
CAI
Here we consider an approach for fast computing the algebraic degree of Boolean functions. It combines fast computing the ANF (known as ANF transform) and thereafter the algebraic degree by using the weight-lexicographic order (WLO) of the vectors of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b87f987af4aa2fdabf7ed0cbe5615bf2
https://doi.org/10.1007/978-3-030-21363-3_5
https://doi.org/10.1007/978-3-030-21363-3_5
Autor:
Valentin Bakoev
The problem "Given a Boolean function $f$ of $n$ variables by its truth table vector. Find (if exists) a vector $\alpha \in \{0,1\}^n$ of maximal (or minimal) weight, such that $f(\alpha)= 1$." is considered here. It is closely related to the problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::643205f7d02074be65643e177ed220cb
http://arxiv.org/abs/1811.04421
http://arxiv.org/abs/1811.04421