Signal and Information Processing

An Efficient (k, p) Notational System Transform Algorithm

Expand
  • 1. School of Information Science and Technology, Xiamen University,Xiamen 361005, Fujian Province, China
    2. School of Cyberspace Security, Information Engineering University,Zhengzhou 450002, China
    3. State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China

Received date: 2011-09-02

  Revised date: 2011-12-12

  Online published: 2011-12-12

Abstract

Muti-ary codes and mix-ary codes are widely used in information hiding, while the transfer efficiency between notational systems is an important factor of coding efficiency. An effective notational system transfer algorithm based on double-coding method is proposed for transforming arbitrary k-ary sequences to
p-ary sequences. It is proved that the proposed notational system transform algorithm is optimal. The method is applied to improve embedding efficiency of several kinds of steganographic algorithms based on mix-ary codes or grouped multi-ary codes, including KT-Lex steganographic system, webpage steganography based on equal tag, grid coloring codes and APPM codes. Both theory analysis and experimental results show that the proposed method is effective.  

Cite this article

CHEN Jia-yong1,2,3, ZHANG Wei-ming2, HU Jin-long2, ZHU Yue-fei2, GUO Dong-hui1 . An Efficient (k, p) Notational System Transform Algorithm[J]. Journal of Applied Sciences, 2013 , 31(6) : 569 -578 . DOI: 10.3969/j.issn.0255-8297.2013.06.004

Outlines

/