|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
Yu. S. Kharin, V. A. Voloshko, “On the approximation of high-order binary Markov chains by parsimonious models”, Diskr. Mat., 34:3 (2022), 114–135  ; Discrete Math. Appl., 34:2 (2024), 71–87 |
|
2020 |
| 2. |
V. A. Voloshko, E. V. Vecherko, “New upper bounds for noncentral chi-square cdf”, Journal of the Belarusian State University. Mathematics and Informatics, 1 (2020), 70–74 |
1
|
|
2019 |
| 3. |
V. A. Voloshko, Yu. S. Kharin, “Semibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimation”, Diskr. Mat., 31:1 (2019), 72–98   ; Discrete Math. Appl., 30:6 (2020), 417–437   |
4
|
|
2016 |
| 4. |
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., 28:1 (2016), 19–43 ; Discrete Math. Appl., 27:4 (2017), 247–268 |
4
|
|
| Organisations |
|
| |
|
|
Contact us: