Araştırma Makalesi
BibTex RIS Kaynak Göster

Correspondence between steganographic protocols and error correcting codes

Yıl 2017, , 197 - 206, 10.01.2017

M’hammed Boulagouaz Mohamed Bouye

https://doi.org/10.13069/jacodesmath.284966

Öz

In this work we present a correspondence between the steganographic systems and error correcting
codes. We propose a new steganographic protocol based on 3-error-correcting primitive BCH codes.
We show that this new protocol has much better parameters than protocols which we get from
Hamming codes or from the 2-error-correcting primitive BCH codes, for high levels of incorporation.

Anahtar Kelimeler

Steganographic protocol Hamming distance Linear correcting code Covering radius Parity matrix BCH code

Kaynakça

  • [1] E. Assmus, H. Mattson, Some 3–error–correcting BCH codes have covering radius 5, IEEE Trans. Inform. Theory 22(3) (1976) 348–349.
  • [2] R. Crandall, Some notes on steganography, available at http://dde.binghamton.edu/download/ Crandall_matrix.pdf, 1998.
  • [3] J. Fridrich, D. Soukal, Matrix embedding for large payloads, IEEE Trans. Inf. Forensics Security 1(3) (2006) 390–395.
  • [4] T. Helleseth, All binary 3–error–correcting BCH codes of length $2^m-1$ have covering radius 5, IEEE Trans. Inform. Theory 24(2) (1978) 257–258.
  • [5] J. van der Horst, T. Berger, Complete decoding of triple–error–correcting binary BCH Codes, IEEE Trans. Inform. Theory 22(2) (1976) 138–147.
  • [6] F. J. Mac Williams, N. Sloane, The Theory of Error Correcting Codes, Amsterdam, Netherlands, North–Holland, 1966.
  • [7] C. Munuera, Steganography and error–correcting codes, Signal Process. 87(6) (2007) 1528–1533.
  • [8] A. Westfeld, F5—A Steganographic Algorithm, Lecture Notes in Comput. Sci. 2137 (2001) 289–302.

Yıl 2017, , 197 - 206, 10.01.2017

M’hammed Boulagouaz Mohamed Bouye

https://doi.org/10.13069/jacodesmath.284966

Öz

Kaynakça

  • [1] E. Assmus, H. Mattson, Some 3–error–correcting BCH codes have covering radius 5, IEEE Trans. Inform. Theory 22(3) (1976) 348–349.
  • [2] R. Crandall, Some notes on steganography, available at http://dde.binghamton.edu/download/ Crandall_matrix.pdf, 1998.
  • [3] J. Fridrich, D. Soukal, Matrix embedding for large payloads, IEEE Trans. Inf. Forensics Security 1(3) (2006) 390–395.
  • [4] T. Helleseth, All binary 3–error–correcting BCH codes of length $2^m-1$ have covering radius 5, IEEE Trans. Inform. Theory 24(2) (1978) 257–258.
  • [5] J. van der Horst, T. Berger, Complete decoding of triple–error–correcting binary BCH Codes, IEEE Trans. Inform. Theory 22(2) (1976) 138–147.
  • [6] F. J. Mac Williams, N. Sloane, The Theory of Error Correcting Codes, Amsterdam, Netherlands, North–Holland, 1966.
  • [7] C. Munuera, Steganography and error–correcting codes, Signal Process. 87(6) (2007) 1528–1533.
  • [8] A. Westfeld, F5—A Steganographic Algorithm, Lecture Notes in Comput. Sci. 2137 (2001) 289–302.
Toplam 8 adet kaynakça vardır.

Ayrıntılar

Konular Mühendislik
Bölüm Makaleler
Yazarlar

M’hammed Boulagouaz Bu kişi benim

Mohamed Bouye

Yayımlanma Tarihi 10 Ocak 2017
Yayımlandığı Sayı Yıl 2017

Kaynak Göster

APA Boulagouaz, M., & Bouye, M. (2017). Correspondence between steganographic protocols and error correcting codes. Journal of Algebra Combinatorics Discrete Structures and Applications, 4(2 (Special Issue: Noncommutative rings and their applications), 197-206. https://doi.org/10.13069/jacodesmath.284966
AMA Boulagouaz M, Bouye M. Correspondence between steganographic protocols and error correcting codes. Journal of Algebra Combinatorics Discrete Structures and Applications. Mayıs 2017;4(2 (Special Issue: Noncommutative rings and their applications):197-206. doi:10.13069/jacodesmath.284966
Chicago Boulagouaz, M’hammed, ve Mohamed Bouye. “Correspondence Between Steganographic Protocols and Error Correcting Codes”. Journal of Algebra Combinatorics Discrete Structures and Applications 4, sy. 2 (Special Issue: Noncommutative rings and their applications) (Mayıs 2017): 197-206. https://doi.org/10.13069/jacodesmath.284966.
EndNote Boulagouaz M, Bouye M (01 Mayıs 2017) Correspondence between steganographic protocols and error correcting codes. Journal of Algebra Combinatorics Discrete Structures and Applications 4 2 (Special Issue: Noncommutative rings and their applications) 197–206.
IEEE M. Boulagouaz ve M. Bouye, “Correspondence between steganographic protocols and error correcting codes”, Journal of Algebra Combinatorics Discrete Structures and Applications, c. 4, sy. 2 (Special Issue: Noncommutative rings and their applications), ss. 197–206, 2017, doi: 10.13069/jacodesmath.284966.
ISNAD Boulagouaz, M’hammed - Bouye, Mohamed. “Correspondence Between Steganographic Protocols and Error Correcting Codes”. Journal of Algebra Combinatorics Discrete Structures and Applications 4/2 (Special Issue: Noncommutative rings and their applications) (Mayıs 2017), 197-206. https://doi.org/10.13069/jacodesmath.284966.
JAMA Boulagouaz M, Bouye M. Correspondence between steganographic protocols and error correcting codes. Journal of Algebra Combinatorics Discrete Structures and Applications. 2017;4:197–206.
MLA Boulagouaz, M’hammed ve Mohamed Bouye. “Correspondence Between Steganographic Protocols and Error Correcting Codes”. Journal of Algebra Combinatorics Discrete Structures and Applications, c. 4, sy. 2 (Special Issue: Noncommutative rings and their applications), 2017, ss. 197-06, doi:10.13069/jacodesmath.284966.
Vancouver Boulagouaz M, Bouye M. Correspondence between steganographic protocols and error correcting codes. Journal of Algebra Combinatorics Discrete Structures and Applications. 2017;4(2 (Special Issue: Noncommutative rings and their applications):197-206.