Minimizing embedding impact in steganography using polar codes

This paper proposes two approaches that reduce the complexity of the Polar Coding Steganography (PCS). The first is based on lookup tables and the second exploits the form of the syndrome, calculated from cover vector and secret message, to evaluate la position of the cover vector changes. The scheme proposed in this paper allows minimizing the embedding impact and gives similar results as those of PCS scheme with a reduced time complexity.