期刊文献+

基于三元Golay隐写码的快速隐写算法 被引量:5

Fast Steganographic Algorithm Based on Ternary Steganographic Golay Code
在线阅读 下载PDF
导出
摘要 研究GF(3)上的编码方法,利用三元Golay码给出一种GF(3)上的隐写码,其隐写性能较常见二元隐写码有显著提高。提出基于三元Golay隐写码的快速隐写算法。该算法有效地降低了隐写算法的计算复杂度,提高了实现效率。 Encoding method for steganographic codes based on GF(3) is presented. A ternary steganographic code is obtained through ternary steganographic Golay codeswhich is better than binary codes. This paper proposes a fast algorithm based on ternary Golay steganographic codes. This algorithm can reduce computational complexity of encoding, improves the efficiency of the steganographic algorithm.
出处 《计算机工程》 CAS CSCD 北大核心 2008年第24期149-151,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60473022) 河南省自然科学基金资助项目(0511011300)
关键词 信息隐藏 隐写码 三元Golay码 快速算法 information hiding steganographic code ternary Golay code fast algorithm
作者简介 刘九芬(1963-),女,副教授,主研方向:信息隐藏,数字水印.E-mail:zqs1501@163.com 李玉辉,硕士. 陈嘉勇,博士研究生. 张卫明,博士后.
  • 相关文献

参考文献12

  • 1Crandall R. Some Notes on Steganography[Z]. (1998-09-07). http://os.inf.tu-dresden.de/-westfeld/Crandall.pdf.
  • 2Westfeld A. High Capacity Despite Better Steganalysis(F5-A Steganographic Algorithm)[C]//Proc. of the 4th International Workshop on Information Hiding. Pittsburgh, PA, USA: Springer-Verlag, 2001: 289-302.
  • 3Tseng Y C, Chen Y Y, Pan H K, et al. A Secure Data Hiding Scheme for Two Color Images[J]. IEEE Transactions on Communications, 2000, 50(8): 1227-1231.
  • 4Tseng Y C, Pan H K. Data Hiding in 2-Color Images[J]. IEEE Transactions on Computers, 2002, 51 (7): 873-890.
  • 5Steganos Security Suite 5 Help Document[Z]. (2004-04-08). http://www.steganos.com/.
  • 6Fridrich J, Soukal D. Matrix Embedding for Large Payloads[J]. IEEE Transactions on Information Security and Forensics, 2006, 1(3): 390-394.
  • 7Fridrich J, Goljan M, Soukal D. Wet Paper Codes with Improved Embedding Efficiency[J]. IEEE Transactions on Information Security and Forensics, 2006, 1(1): 102-110.
  • 8Schonfeld D, Winkler A. Embedding with Syndrome Coding Based on BCH Codes[C]//Proceedings of ACM Multimedia and Security Workshop. Geneva, Switzerland: ACM Press, 2006: 214-223.
  • 9Fridrich J, Lisonek P, Soukal D. On Steganographic Embedding Efficiency[C]//Proc. of the 8th International Workshop on Information Hiding. Alexandria, VA, USA:[s. n.], 2007.
  • 10Mielikainen J, Member. LSB Matching Revisited[J]. IEEE Signal Processing Letters, 2006, 13(5): 285-287.

二级参考文献1

  • 1马建峰,博士学位论文,1995年

共引文献1

同被引文献86

  • 1张卫明,李信然,李世取.线性隐写码的性质与构造[J].工程数学学报,2007,24(3):547-550. 被引量:3
  • 2张新鹏,王朔中.基于稀疏表示的密写编码[J].电子学报,2007,35(10):1892-1896. 被引量:9
  • 3Dodunekov S M,Landgev I N.On near MDS codes, Report LiTH-ISY-R-1563[R].Sweden: Department of Engi- neering, Linkoping University, 1994.
  • 4Dodunekov S M, Landgev I N.On near MDS codes[J]. Journal of Geometry, 1995,54 : 30-43.
  • 5De Bore M A.Almost MDS codes[J].Designs, Codes, and Cryptography, 1996,9: 143-155.
  • 6Dougherty S T, Shiromoto K.Maximum distance codes over rings of ordre 4[J].IEEE Trans on Inform Theory, 2001,47 : 400-404.
  • 7Huffman W C, Pless V S.Fundamentals of error-correcting codes[M].Cambridge:Cambrige University Press,2003.
  • 8Word J.Duality for modules over finite rings and appli- cations to coding theory[J].Amer J Math, 1999,121:555-575.
  • 9Dougherty S T, Shiromoto K.Maximum distance codes over rings of order 4[J].IEEE Trans on Inform Theory, 2011,47 : 400-404.
  • 10Dodunekov S M,Landgev I N. On Near MDS Codes[J].Journal of Geometry,1995,(01):30-43.

引证文献5

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部