Steganography via covering codes

被引：0
|
作者：
Galand, F [1 ]
Kabatiansky, G [1 ]
机构：
[1] INRIA, Projet CODES, Le Chesnay, France
来源：
2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 2003年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We prove the equivalence of the embedding problem in two-color images and problems related to coverings in both passive and active adversary models, respectively the covering of binary Hamming space and the centered error-correcting codes. In both cases we give bounds and constructions.
引用
收藏
页码：192 / 192
页数：1
相关论文
共 50 条
  • [1] Improving embedding efficiency of covering codes for applications in steganography
    Zhang, Weiming
    Wang, Shuozhong
    Zhang, Xinpeng
    [J]. IEEE COMMUNICATIONS LETTERS, 2007, 11 (08) : 680 - 682
  • [2] Linear Programming Bounds for Codes via a Covering Argument
    Michael Navon
    Alex Samorodnitsky
    [J]. Discrete & Computational Geometry, 2009, 41
  • [3] Lower bounds on covering codes via partition matrices
    Haas, Wolfgang
    Schlage-Puchta, Jan-Christoph
    Quistorff, Joern
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2009, 116 (02) : 478 - 484
  • [4] Linear Programming Bounds for Codes via a Covering Argument
    Navon, Michael
    Samorodnitsky, Alex
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2009, 41 (02) : 199 - 207
  • [5] PERMUTATION CODES AND STEGANOGRAPHY
    Balado, Felix
    Haughton, David
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 2954 - 2958
  • [6] Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
    Heger, Tamas
    Nagy, Zoltan Lorant
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (02) : 881 - 890
  • [7] Optimal binary vector quantization via enumeration of covering codes
    Wu, XL
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (02) : 638 - 645
  • [8] Empirical and Strong Coordination via Soft Covering With Polar Codes
    Chou, Remi A.
    Bloch, Matthieu R.
    Kliewer, Jorg
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (07) : 5087 - 5100
  • [9] Optimal binary vector quantization via enumeration of covering codes
    Univ of Western Ontario, London, Canada
    [J]. IEEE Trans Inf Theory, 2 (638-645):
  • [10] DECODING SHORT BINARY CYCLIC CODES VIA COVERING POLYNOMIALS
    SUNG, WJ
    COFFEY, JT
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1994, 5 (06): : 653 - 664
12345