Publication Type:

Journal Article

Source:

Communications in Computer and Information Science, Volume 192 CCIS, Number PART 3, Kochi, p.269-275 (2011)

ISBN:

9783642227196

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-80051569612&partnerID=40&md5=99363d9f2597441837b12c5388a9933c

Keywords:

Binary linear codes, Chisquare, Embedding capacity, Embedding efficiency, matrix, Matrix algebra, Random linear codes, RS steganalysis, Steganalysis, Steganographic schemes, Steganography, Stego image

Abstract:

To improve embedding efficiency, one of the most important steganographic scheme isMatrix embedding, otherwise known as syndrome coding. The schemes that employ matrix embedding is generally more secure because it brings about lower embedding changes.. In this paper matrix embedding scheme based on random linear codes of small dimension is considered. It is suitable for large payloads which makes it appropriate for practical applications. This scheme is efficient for embedding messages close to the embedding capacity. This scheme not only provides high embedding capacity but also enhances the quality of the stego image. The method is proved to withstand attacks like Chi-square and RS steganalysis. © 2011 Springer-Verlag.

Notes:

cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@2be5d87a ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@7ee74819 Through org.apache.xalan.xsltc.dom.DOMAdapter@22ea266; Conference Code:86007

Cite this Research Publication

P. Harmya, Anju, S. S., Jagadeesh, N., and Nandakumar, A., “Matrix embedding using random linear codes and its steganalysis”, Communications in Computer and Information Science, vol. 192 CCIS, pp. 269-275, 2011.