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
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Hamming Code in Computer Network
- Implementation of Blockchain in Java
- Java Implementation of Deffi-Hellman Algorithm between Client and Server
- How to generate and read QR code with Java using ZXing Library
- Java Code for Moving Text | Applet | Thread
- Java | CDMA (Code Division Multiple Access)
- Rabin Cryptosystem with Implementation
- Implementation of Affine Cipher
- UDP Server-Client implementation in C
- TCP Server-Client implementation in C
- Implementation of a Back-off Algorithm for CSMA/CD
- Approaches to Information Security Implementation
- Implementation of Diffie-Hellman Algorithm
- How message authentication code works?
- What is HMAC(Hash based Message Authentication Code)?
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.