A Survey on Hamming Codes for Error Detection

Transferred information may gets damaged many-a-times during signal transmission. Therefore, the signals received by the receiver are erroneous and different to what the sender had originally sent. This paper provides a comparison between three different types of error detecting codes, all based on the basic hamming code principle. Each code has its own efficiency in the way it functions, its power/area consumption etc., and its own correction capabilities. In this paper we focus on the working of these three error detecting codes and try to find out the more effective one.[1] [3] [4]

[1]  Dhiraj K. Pradhan,et al.  Matrix Codes for Reliable and Cost Efficient Memory Chips , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  N. S. Murty,et al.  Horizontal-vertical parity and diagonal hamming based soft error detection and correction for memories , 2017, 2017 International Conference on Computer Communication and Informatics (ICCCI).

[3]  M. Vinodhini,et al.  Error detection and correction in semiconductor memories using 3D parity check code with hamming code , 2017, 2017 International Conference on Communication and Signal Processing (ICCSP).

[4]  Muhammad Sheikh Sadi,et al.  Soft error tolerance using Horizontal-Vertical-Double-Bit Diagonal parity method , 2015, 2015 International Conference on Electrical Engineering and Information Communication Technology (ICEEICT).

[5]  Narinder Sharma,et al.  A Review on Various Error Detection and Correction Methods Used in Communication , 2015 .

[6]  Hossein Pedram,et al.  HVD: horizontal-vertical-diagonal error detecting and correcting code to protect against with soft errors , 2011, Des. Autom. Embed. Syst..

[7]  Vishal Badole,et al.  Implementation of Multidirectional Parity Check Cod e Using Hamming Code for Error Detection and Correction , 2014 .

[8]  B. Murugeshwari,et al.  Random and Triple burst error correction code with low redundancy for Network-on-Chip link , 2018, 2018 International Conference on Computer Communication and Informatics (ICCCI).

[9]  Hsuan-Yin Lin,et al.  Connections Between the Error Probability and the r-wise Hamming Distances , 2018, 2018 International Symposium on Information Theory and Its Applications (ISITA).

[10]  R. A. Comley.  Error detection and correction for memories , 1978, Microprocess..

[11]  Samuel Cheng,et al.  The Universality of Generalized Hamming Code for Multiple Sources , 2011, IEEE Transactions on Communications.

[12]  Hyun Kwang Kim,et al.  Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code , 2019, IEEE Transactions on Information Theory.

[13]  Richard Ehrenborg.  Decoding the Hamming Code , 2006 .