Variable Rate Syndrome-Trellis Codes for Steganography on Bursty Channels.

This paper presents a type of variable rate syndrome-trellis codes (VR-STC) for bursty channels. It can embed message bits with two different embedding rates. In the embedding, a cover vector is sliced into segments, and the embedding rates for each segment depend on the local channel distribution. The parities of stego segments are exploited to indicate the selected embedding rates according to a mapping function between parities and embedding rates. The core of the VR-STC is the parity-aware encoder, which can simultaneously output two candidate stego segments with different embedding rates and opposite parities, either of which can be used to constitute the final stego vector. A Viterbi algorithm is also suggested to find the closed stego segments. Besides, the mapping function between parities and embedding rates is designed by minimizing the embedding costs on a down sampled version of the cover vector. It can further improve the undetectability of the VR-STC. Experimental results on artificial signals and binary images suggest that the proposed VR-STC can provide high success rate of embedding and reduce the embedding cost on bursty channels.