| 线性隐写码的性质与构造 |
| |
| 引用本文： | 张卫明,李信然,李世取.线性隐写码的性质与构造[J].工程数学学报,2007,24(3):547-550. |
| |
| 作者姓名： | 张卫明 李信然 李世取 |
| |
| 作者单位： | 1. 上海大学通信与信息工程学院,上海,200072;信息工程大学电子技术学院,郑州,450004
2. 信息工程大学电子技术学院,郑州,4500041 |
| |
| 基金项目： | 国家自然科学基金
,
河南省自然科学基金 |
| |
| 摘 要： | 本文从隐写术的安全性需求出发抽象出一个新的编码问题,称之为隐写码。利用线性空间的直和分解得到了一种线性隐写码的构造方法。通过引入线性空间t阶维数的概念将线性隐写码问题转化成了一个代数问题,从而得到了线性隐写码长度的上界,并由此定义了最大长度可嵌入码。证明了线性最大长度可嵌入码与线性完备纠错码有1-1对应关系。
|
| 关 键 词： | 隐写术 隐写码 最大长度可嵌入码 完备码 |
| 文章编号： | 1005-3085(2007)03-0547-04 |
| 修稿时间： | 2005-06-14 |
The Properties and Constructions of Linear Steganographic Codes |
| |
| ZHANG Wei-ming,LI Xin-ran,LI Shi-qu.The Properties and Constructions of Linear Steganographic Codes[J].Chinese Journal of Engineering Mathematics,2007,24(3):547-550. |
| |
| Authors: | ZHANG Wei-ming LI Xin-ran LI Shi-qu |
| |
| Affiliation: | 1. School of Communication and Information Engineering, Shanghai University, Shanghai 200072 ; 2. Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004 |
| |
| Abstract: | A new coding problem,steganographic codes (abbreviated stego-codes),is derived from the problem of steganography.First,the method for constructing linear stego-codes is proposed by using the direct sum of vector subspaces.Secondly,the problem of linear stego-codes is converted to an algebraic problem by introducing the tth dimension for vector spaces.The bound on the length of linear stego-codes is obtained,based on which the maximum length embeddable (MLE) codes are brought up.Furthermore,it is shown that there is a one-to-one correspondence between linear MLE codes and linear perfect error-correcting codes. |
| |
| Keywords: | steganography stego-codes MLE codes perfect codes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
