Steganographic capacity for one-dimensional Markov cover

DOI10.1515/dma-2017-0026zbMath1378.94068OpenAlexW2747414859MaRDI QIDQ1692741

Valeriy A. Voloshko

Publication date: 10 January 2018

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0026

zbMATH Keywords

capacitybinary sequencesteganographyshift-invariant measure

Mathematics Subject Classification ID

Cryptography (94A60) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Source coding (94A29)

Related Items (3)

Statistical analysis of conditionally binomial nonlinear regression time series with discrete regressors ⋮ Semibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimation ⋮ Statistical estimation of parameters for binary conditionally nonlinear autoregressive time series

Cites Work

• Random walks on discrete groups: Boundary and entropy
• A parametric model of embedding and its statistical analysis
• Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
• On the finite-dimensional marginals of shift-invariant measures
• Capacity of Steganographic Channels
• Statistical estimation of parameters for binary Markov chain models with embeddings

This page was built for publication: Steganographic capacity for one-dimensional Markov cover