【24h】

A capacity self-adaption information hiding algorithm based on RS code

机译:基于RS码的容量自适应信息隐藏算法

获取原文
获取原文并翻译 | 示例

摘要

Information hiding based on error correcting code is one of the difficulties in information hiding research. Current information hiding algorithms cannot confirm the upper bound of covert channel capacity when channels are interfered. In this paper, a capacity self-adaption information hiding algorithm based on RS code is proposed to solve this problem. Firstly, Channel covert communication model is designed to describe the realization of information hiding algorithms based on the m-sequence. Secondly, the upper bound of embedding capacity of secret information based on block code and RS code is separately analyzed in theory. Thirdly, simulation verification is implemented under the supposed channel environment. Experimental results demonstrated that experimental values are consistent with the theoretical values, and in terms of the embedding rate, the performance of the RS code is better than the performance of recurrent code and block code.
机译:基于纠错码的信息隐藏是信息隐藏研究的难点之一。当信道受到干扰时,当前的信息隐藏算法无法确定隐蔽信道容量的上限。为此,提出了一种基于RS码的容量自适应信息隐藏算法。首先,设计了信道隐蔽通信模型,描述了基于m序列的信息隐藏算法的实现。其次,从理论上分别分析了基于分组码和RS码的秘密信息嵌入能力的上限。第三,在假定的信道环境下进行仿真验证。实验结果表明,实验值与理论值基本一致,就嵌入率而言,RS码的性能优于循环码和块码的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号