$\mathbb{Z}_2\mathbb{Z}_4$-additive perfect codes in Steganography | Zendy

Lorena Ronquillo | Zendy; Josep Rifà | Zendy; Helena Rifà-Pous | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

$\mathbb{Z}_2\mathbb{Z}_4$-additive perfect codes in Steganography

Author(s) -

Lorena Ronquillo,

Josep Rifà,

Helena Rifà-Pous

Publication year - 2011

Publication title -

advances in mathematics of communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.601

H-Index - 26

eISSN - 1930-5346

pISSN - 1930-5338

DOI - 10.3934/amc.2011.5.425

Subject(s) - steganography , mathematics , cover (algebra) , payload (computing) , coding (social sciences) , upper and lower bounds , boundary (topology) , distortion (music) , symbol (formal) , embedding , algorithm , combinatorics , discrete mathematics , computer science , statistics , mathematical analysis , artificial intelligence , telecommunications , mechanical engineering , computer network , amplifier , bandwidth (computing) , network packet , engineering , programming language

Steganography is an information hiding application which aims to hide secret data imperceptibly into a cover object. In this paper, we describe a novel coding method based on $\mathbb{Z}_2\mathbb{Z}_4$-additive codes in which data is embedded by distorting each cover symbol by one unit at most ($\pm 1$-steganography). This method is optimal and solves the problem encountered by the most efficient methods known today, concerning the treatment of boundary values. The performance of this new technique is compared with that of the mentioned methods and with the well-known rate-distortion upper bound to conclude that a higher payload can be obtained for a given distortion by using the proposed method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research