A Comparative Study between Hamming Code and Reed-Solomon Code in Byte Error Detection and Correction

Abstract

This work concerns the comparative study between Hamming code and Reed-Solomon (RS) code in byte error detection and correction. Data are either stored in storage applications or transferred through a media. In either case there is problem of data corruption due to noise and interference, which has to be corrected as soon as they occur to prevent erroneous information throughout the system. The basis is to incorporate the original data with some form of redundancy. With this redundancy, even if errors are introduced, the original information can be recovered or at least the presence of error can be detected. Redundancy is added by the encoder and sent over the channel where noise in the form of error distorts the data. The message reaches the receiving end through the decoder where errors are removed, redundancy stripped off and the original message is then produced. This paper compared Hamming code and Reed-Solomon code in respect to their efficiency in adding and removing this redundancy. I find Reed-Solomon code to be highly efficient and more powerful than Hamming code for data communication because of it high coding rate and yet with a minimum coding complexity.

Authors and Affiliations

Chukwuma Okeke, M. Eng

Keywords

Related Articles

Understanding the Fundamentals of Machine Learning Field, Its Evolution & Its Need

Since the time of inception of computers, many computer scientists and researchers have been fascinated by the idea of programming machines in such a manner that can make them learn the way humans do from their surround...

Rating Of Product Using Data Mining Of Sales Data

In this paper a new product rating approach for mathematically and graphically analyzing sales of same type of products from different manufactures and with most frequent combination of items is proposed. In product sal...

Optimization of Corrugated Sheet Box Size for an Industrial Part– A Case Study

Corrugated box produced in large volume for packaging purpose an application which place high demand on its strength and structural stability of the corrugated sheet box. while studying the different industrial boxes it...

Mining of Frequent Itemset in Hadoop

Information are produced from different sources, the quick move from computerized advances has prompted development of huge information. Terabytes of information is produced every day by modern information systems and d...

Performance Evaluation of QOS Routing in Computer Network

This paper evaluates “Optimized Link State Routing Protocol” (OLSR) routing measurement performance analysis based on different simulation parameters. We have used NS-2 simulator tools for the performance of OLSR routin...

Download PDF file
  • EP ID EP21461
  • DOI -
  • Views 511
  • Downloads 19

How To Cite

Chukwuma Okeke, M. Eng (2015). A Comparative Study between Hamming Code and Reed-Solomon Code in Byte Error Detection and Correction. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 3(12), -. https://europub.co.uk/articles/-A-21461