@article{DM_2016_28_1_a1,
     author = {V. A. Voloshko},
     title = {Steganographic capacity for one-dimensional {Markov} cover {Steganographic} capacity for one-dimensional {Markov} cover {[1]Valeriy} {A.} {Voloshko} {V.} {A.} {Voloshko} [1] {Belarusian} {State} {University,} e-mail: valeravoloshko@yandex.ru {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$). {{\textquotedblleft}Special} correction{\textquotedblright} 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.} },
     journal = {Diskretnaya Matematika},
     pages = {19--43},
     year = {2016},
     volume = {28},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2016_28_1_a1/}
}