Pre-requisite: Hamming code
Hamming code is a set of error-correction codes that can be used to detect and correct the errors that can occur when the data is moved or stored from the sender to the receiver. It is a technique developed by R.W. Hamming for error correction.
Input: message bit = 0101 r1 r2 m1 r4 m2 m3 m4 0 1 0 1 Output: Generated codeword : r1 r2 m1 r4 m2 m3 m4 0 1 0 0 1 0 1 Explanation: Initially r1, r2, r4 is set to '0'. r1 = xor of all bits position which has '1' in its 0th-bit position r2 = xor of all bits which has '1' in its 1st-bit position r3 = xor of all bits which has '1' in its 2nd-bit position
Below is the implementation of the Hamming Code:
Generated hamming code r1 = 0 r2 = 1 r4 = 0 0100101
- Hamming Code in Computer Network
- Java Implementation of Deffi-Hellman Algorithm between Client and Server
- Java Code for Moving Text | Applet | Thread
- Java | CDMA (Code Division Multiple Access)
- Implementation of Affine Cipher
- TCP Server-Client implementation in C
- UDP Server-Client implementation in C
- Implementation of Diffie-Hellman Algorithm
- How message authentication code works?
- Java 8 | BiConsumer Interface in Java with Examples
- Java 8 | Consumer Interface in Java with Examples
- Java 8 | IntToLongFunction Interface in Java with Examples
- MD5 hash in Java
- Sorting in Java
- MD2 Hash In Java
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.