|
Author Index, 2016, Volume 28
P. V. Roldugin
Cardinality of subsets of the residue group with nonunit differences of elements
Diskr. Mat., 2016, Volume 28:3, 111–125
|
P. V. Roldugin
On the number of subsets of the residue ring such that the difference of any pair of elements is not invertible
Diskr. Mat., 2016, Volume 28:4, 122–138
|
V. I. Afanasyev
Functional limit theorem for a stopped random walk attaining a high level
Diskr. Mat., 2016, Volume 28:3, 3–13
|
V. I. Afanasyev
On the non-recurrent random walk in a random environment
Diskr. Mat., 2016, Volume 28:4, 6–28
|
A. I. Afonina, I. R. Kayumov, A. N. Chuprunov
Asymptotics of conditional probabilities of succesful allocation of random number of particles into cells
Diskr. Mat., 2016, Volume 28:3, 14–25
|
S. A. Aivazyan, V. B. Alekseev, V. A. Vatutin, M. M. Glukhov, A. A. Grusho, V. A. Emelichev, A. M. Zubkov, G. I. Ivchenko, O. M. Kasim-zade, V. A. Kashtanov, I. N. Kovalenko, V. B. Kudryavtsev, V. V. Mazalov, Yu. V. Matiyasevich, Yu. I. Medvedev, V. G. Mikhailov, Yu. L. Pavlov, B. A. Pogorelov, È. A. Primenko, L. Ya. Savel'ev, V. N. Sachkov, S. A. Stepanov, V. P. Chistyakov, V. N. Chubarikov
Валентин Федорович Колчин (1934–2016)
Diskr. Mat., 2016, Volume 28:4, 3–5
|
V. B. Alekseev, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
A. S. Baliuk, A. S. Zinchenko
Lower bound for the complexity of five-valued polarized polynomials
Diskr. Mat., 2016, Volume 28:4, 29–37
|
V. N. Bezverkhnii, E. S. Logacheva
Conjugacy word problem in the tree product of free groups with a cyclic amalgamation
Diskr. Mat., 2016, Volume 28:1, 3–18
|
A. D. Bugrov
The cross-correlation function of complications of linear recurrent sequences
Diskr. Mat., 2016, Volume 28:4, 38–49
|
A. V. Chashkin
Bounds for the average-case complexity of monotone Boolean functions
Diskr. Mat., 2016, Volume 28:2, 146–153
|
M. A. Cherepnev
Extension of the Rissanen algorithm to the factorization of block-Hankel matrices for solving systems of linear equations
Diskr. Mat., 2016, Volume 28:1, 150–155
|
M. A. Cherepnev
Modular algorithm for reducing matrices to the Smith normal form
Diskr. Mat., 2016, Volume 28:2, 154–160
|
V. P. Chistyakov, see B. I. Selivanov
Diskr. Mat., 2016, Volume 28:2, 92–107
|
V. P. Chistyakov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
V. N. Chubarikov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
A. M. Chudnov
Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games
Diskr. Mat., 2016, Volume 28:3, 145–159
|
A. N. Chuprunov, see A. I. Afonina
Diskr. Mat., 2016, Volume 28:3, 14–25
|
A. B. Dainiak, A. A. Sapozhenko
Independent sets in graphs
Diskr. Mat., 2016, Volume 28:1, 44–77
|
D. V. Dmitrushchenkov, A. V. Shklyaev
Large deviations of branching processes with immigration in random environment
Diskr. Mat., 2016, Volume 28:3, 28–48
|
Elena E. D'yakonova
Reduced multitype critical branching processes in random environment
Diskr. Mat., 2016, Volume 28:4, 58–79
|
V. A. Emelichev, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
E. V. Feklistova, see Yu. L. Pavlov
Diskr. Mat., 2016, Volume 28:2, 58–70
|
È. È. Gasanov, A. M. Zubkov, N. V. Klykova
The algorithm for identical object searching with bounded worst-case complexity and linear memory
Diskr. Mat., 2016, Volume 28:2, 3–11
|
M. M. Glukhov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
A. A. Grusho, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
G. I. Ivchenko, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
O. V. Kamlovskii
Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
Diskr. Mat., 2016, Volume 28:2, 27–43
|
V. A. Kashtanov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
O. M. Kasim-zade, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
I. R. Kayumov, see A. I. Afonina
Diskr. Mat., 2016, Volume 28:3, 14–25
|
Ya. M. Khusanbaev
On asymptotics of branching processes with immigration
Diskr. Mat., 2016, Volume 28:1, 113–122
|
N. V. Klykova, see È. È. Gasanov
Diskr. Mat., 2016, Volume 28:2, 3–11
|
V. V. Kochergin, A. V. Mikhailovich
The minimum number of negations in circuits for systems of multi-valued functions
Diskr. Mat., 2016, Volume 28:4, 80–90
|
I. N. Kovalenko, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
V. B. Kudryavtsev, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
E. S. Logacheva, see V. N. Bezverkhnii
Diskr. Mat., 2016, Volume 28:1, 3–18
|
A. M. Magomedov, T. A. Magomedov
Successive partition of edges of bipartite graph into matchings
Diskr. Mat., 2016, Volume 28:1, 78–86
|
T. A. Magomedov, see A. M. Magomedov
Diskr. Mat., 2016, Volume 28:1, 78–86
|
D. S. Malyshev
Complexity classification of the edge coloring problem for a family of graph classes
Diskr. Mat., 2016, Volume 28:2, 44–50
|
D. S. Malyshev, see D. S. Taletskii
Diskr. Mat., 2016, Volume 28:4, 139–149
|
F. M. Malyshev
Distribution of the extreme values of the number of ones in Boolean analogues of the Pascal triangle
Diskr. Mat., 2016, Volume 28:3, 59–96
|
S. S. Marchenkov
On FE-precomplete classes in countable-valued logic
Diskr. Mat., 2016, Volume 28:2, 51–57
|
S. S. Marchenkov
Bounded prefix concatenation operation and finite bases with respect to the superposition
Diskr. Mat., 2016, Volume 28:4, 91–99
|
Yu. V. Matiyasevich, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
V. V. Mazalov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
Yu. I. Medvedev, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
V. G. Mikhailov
On the probability of existence of substrings with the same structure in a random sequence
Diskr. Mat., 2016, Volume 28:3, 97–110
|
V. G. Mikhailov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
A. V. Mikhailovich, see V. V. Kochergin
Diskr. Mat., 2016, Volume 28:4, 80–90
|
Yu. L. Pavlov, E. V. Feklistova
On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
Diskr. Mat., 2016, Volume 28:2, 58–70
|
Yu. L. Pavlov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
B. A. Pogorelov, M. A. Pudovkina
On groups containing the additive group of the residue ring or the vector space
Diskr. Mat., 2016, Volume 28:4, 100–121
|
B. A. Pogorelov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
K. A. Popkov
Tests of contact closure for contact circuits
Diskr. Mat., 2016, Volume 28:1, 87–100
|
E. A. Potekhina
Application of Hadamard product to some combinatorial and probabilistic problems
Diskr. Mat., 2016, Volume 28:1, 101–112
|
È. A. Primenko, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
M. A. Pudovkina, see B. A. Pogorelov
Diskr. Mat., 2016, Volume 28:4, 100–121
|
V. N. Sachkov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
A. A. Sapozhenko, see A. B. Dainiak
Diskr. Mat., 2016, Volume 28:1, 44–77
|
V. G. Sargsyan
Estimates of the number of $(k,l)$-sumsets in the finite Abelian group
Diskr. Mat., 2016, Volume 28:2, 71–80
|
L. Ya. Savel'ev, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
M. P. Savelov, see A. M. Zubkov
Diskr. Mat., 2016, Volume 28:3, 49–58
|
S. N. Selezneva
On the number of functions of $k$-valued logic which are polynomials modulo composite $k$
Diskr. Mat., 2016, Volume 28:2, 81–91
|
B. I. Selivanov, V. P. Chistyakov
Limit theorems for the number of successes in random binary sequences with random embeddings
Diskr. Mat., 2016, Volume 28:2, 92–107
|
A. S. Semenov, D. A. Shabanov
Independence numbers of random sparse hypergraphs
Diskr. Mat., 2016, Volume 28:3, 126–144
|
I. S. Sergeev
Upper bounds for the size and the depth of formulae for MOD-functions
Diskr. Mat., 2016, Volume 28:2, 108–116
|
D. A. Shabanov, see A. S. Semenov
Diskr. Mat., 2016, Volume 28:3, 126–144
|
A. V. Shklyaev, see D. V. Dmitrushchenkov
Diskr. Mat., 2016, Volume 28:3, 28–48
|
S. V. Smyshlyaev
On $1$-stable perfectly balanced Boolean functions
Diskr. Mat., 2016, Volume 28:2, 117–126
|
S. A. Stepanov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
V. A. Taimanov
On bases of closed classes of vector functions of many-valued logic
Diskr. Mat., 2016, Volume 28:2, 127–132
|
D. S. Taletskii, D. S. Malyshev
On the number of maximal independent sets in complete $q$-ary trees
Diskr. Mat., 2016, Volume 28:4, 139–149
|
V. N. Tsypyschev
The second coordinate sequence of the MP-LRS over nontrivial Galois ring of an odd characteristic
Diskr. Mat., 2016, Volume 28:1, 123–149
|
A. A. Tuganbaev
Bezout rings without non-central idempotents
Diskr. Mat., 2016, Volume 28:2, 133–145
|
A. A. Tuganbaev
On serial rings
Diskr. Mat., 2016, Volume 28:4, 150–157
|
V. A. Vatutin, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
V. A. Voblyi
On the number of labeled outerplanar $k$-cycle blocks
Diskr. Mat., 2016, Volume 28:3, 26–27
|
V. A. Voloshko
Steganographic capacity for one-dimensional Markov cover} \runningtitle{Steganographic capacity for one-dimensional Markov cover} \author*[1]{Valeriy A. Voloshko} \runningauthor{V. A. Voloshko} \affil[1]{ Belarusian State University, e-mail: valeravoloshko@yandex.ru} \abstract{For shift-invariant probability measures on the set of infinite two-sided binary sequences (one-dimensional covers) we introduce the notion of capacity as a maximum portion of embedded into the cover uniformly distributed (purely random) binary sequence (message) that admits special correction of the cover restoring its distribution up to distribution of $n$-tuples (subwords of some fixed length $n$). “Special correction” is carried out using the proposed new algorithm that changes some of the cover's symbols not occupied by embedded message. The features of the introduced capacity are examined for the Markov cover. In particular, we show how capacity may be significantly increased by weakening of the standard constraint that positions for message embedding have to be chosen by independent unfair coin tosses. Experimental results are presented for correction of real steganographic covers after LSB-embedding.} \keywords{binary sequence, shift-invariant measure, steganography, capacity
Diskr. Mat., 2016, Volume 28:1, 19–43
|
A. A. Voronenko, M. N. Vyalyi
Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions
Diskr. Mat., 2016, Volume 28:4, 50–57
|
M. N. Vyalyi, see A. A. Voronenko
Diskr. Mat., 2016, Volume 28:4, 50–57
|
D. V. Zakablukov
On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
Diskr. Mat., 2016, Volume 28:2, 12–26
|
A. S. Zinchenko, see A. S. Baliuk
Diskr. Mat., 2016, Volume 28:4, 29–37
|
A. M. Zubkov, see È. È. Gasanov
Diskr. Mat., 2016, Volume 28:2, 3–11
|
A. M. Zubkov, M. P. Savelov
Convergence of the sequence of the Pearson statistics values to the normalized square of the Bessel process
Diskr. Mat., 2016, Volume 28:3, 49–58
|
A. M. Zubkov, see S. A. Aivazian
Diskr. Mat., 2016, Volume 28:4, 3–5
|
|
|
Contact us: