CFP last date
20 June 2024
Reseach Article

The Art of Data Hiding with Reed-Solomon Error Correcting Codes

by Fredrick R. Ishengoma
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 106 - Number 14
Year of Publication: 2014
Authors: Fredrick R. Ishengoma

Fredrick R. Ishengoma . The Art of Data Hiding with Reed-Solomon Error Correcting Codes. International Journal of Computer Applications. 106, 14 ( November 2014), 28-31. DOI=10.5120/18590-9902

@article{ 10.5120/18590-9902,
author = { Fredrick R. Ishengoma },
title = { The Art of Data Hiding with Reed-Solomon Error Correcting Codes },
journal = { International Journal of Computer Applications },
issue_date = { November 2014 },
volume = { 106 },
number = { 14 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 28-31 },
numpages = {9},
url = { },
doi = { 10.5120/18590-9902 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T22:39:24.688868+05:30
%A Fredrick R. Ishengoma
%T The Art of Data Hiding with Reed-Solomon Error Correcting Codes
%J International Journal of Computer Applications
%@ 0975-8887
%V 106
%N 14
%P 28-31
%D 2014
%I Foundation of Computer Science (FCS), NY, USA

With the tremendous advancements in technology and the Internet, data security has become a major issue around the globe. To guarantee that data is protected and does not go to an unintended endpoint, the art of data hiding (steganography) emerged. Steganography is the art of hiding information such that it is not detectable to the naked eye. Various techniques have been proposed for hiding a secret message in a carrier document. In this paper, we present a novel design that applies Reed-Solomon (RS) error correcting codes in steganographic applications. The model works by substituting the redundant RS codes with the steganographic message. The experimental results show that the proposed design is satisfactory with the percentage of decoded information 100% and percentage of decoded secret message 97. 36%. The proposed model proved that it could be applied in various steganographic applications.

  1. Kavitha, Kavita Kadam, Ashwini Koshti and Priya Dunghav. 2012. Steganography Using Least Significant Bit Algorithms. International Journal of Engineering Research and Applications, Vol. 2, No. 3, pp. 338-341.
  2. Benjamin Barán, Santiago Gómez and Victor Bogarín. 2001. Steganographic Watermarking for Documents. In Proceedings of the 34th Annual Hawaii International Conference on System Sciences, pp. 1-10.
  3. Khosravi Sara, Abbasi Dezfoli Mashallah and Yektaie Mohammad Hossein. 2011. A New Steganography Method Based on HIOP (Higher Intensity of Pixel) Algorithm and Strassen's Matrix Multiplication. Journal of Global Research in Computer Science, Vol. 2, No. 1, pp. 6-12.
  4. Huaiqingwang and Shuozhong Wang. 2004. Cyber Warfare: Steganography vs. Steganalysis. Communications of the ACM, Vol. 47, No. 10, pp. 76-82.
  5. W. Bender, G. Gruhi, N. Morimoto and A. Liu. 1996. Techniques for Data Hiding. IBM Systems Journal, Volume 35, Number 3 & 4.
  6. Rongyue Zhang, Vasiliy Sachnev, Hyoung Joong Kim. 2009. Fast BCH Syndrome Coding for Steganography. Information Hiding, volume 5806 of Lecture Notes in Computer Science, page 48-58. Springer.
  7. Vasiliy Sachnev, Hyoung Joong Kim, Rongyue Zhang. 2009. Less Detectable JPEG Steganography Method based on Heuristic Optimization and BCH Syndrome Coding. In Proceedings of 11st ACM Workshop on Multimedia and Security, Princeton, New Jersey, USA.
  8. I. Diop, S. M Farssi, O. Khouma, H. B. Diouf, K. Tall, K. Sylla. 2012. New Steganographic Scheme Based of Reed-Solom Codes. International Journal of Distributed and Parallel System (IJDPS), Volume 3, Number 2.
  9. Bin Liu, Junhui He, Jiwu Huang, Yun Qing Shi. 2011. A Survey on Image Steganography and Steganalysis. Journal of Information Hiding and Multimedia Signal Processing, Volume 2, Number 2.
  10. Dagmar Schönfeld and Antje Winkler. 2006. Embedding with Syndrome Coding Based on BCH Codes. In Proceedings of the 8th Workshop on Multimedia and Security (MM&Sec '06), ACM, New York, NY, USA, 214-223.
  11. Reed, Irving S. ; Solomon, Gustave. 1960. Polynomial Codes over Certain Finite Fields. Journal of the Society for Industrial and Applied Mathematics (SIAM) 8 (2): 300–304.
  12. Hamming, Richard W. 1950. Error Detecting and Error Correcting Codes. Bell System Technical Journal 29 (2): 147–160.
  13. Fredrick R. Ishengoma. 2013. HDFS+ Erasure Coding Based Hadoop Distributed File System", International Journal of Scientific & Technology Research, Vol. 2 – Issue 8.
  14. Victor Y. Pan. 2014. Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions. The 9th International Computer Science Symposium (CSR 2014), Moscow, Russia.
  15. Paulo S. L. M. Barreto and Rafael Misoczki. 2011. A New One-Time Signature Scheme from Syndrome Decoding. Journal of Systems and Software Volume 84, Issue 2, pp. 198 – 204.
  16. Zunaira Babar, Soon Xin Ng, and Lajos Hanzo. 2013. Reduced-Complexity Syndrome-Based TTCM Decoding. IEEE Communication Letters, Volume 17, Issue 6, pp. 1220 - 1223.
Index Terms

Computer Science
Information Sciences


Reed-Solomon Error Correcting Codes