Differences

This shows you the differences between two versions of the page.

--- tanszek:oktatas:techcomm:error_detection_and_correction [2024/11/12 07:26] – knehez
+++ tanszek:oktatas:techcomm:error_detection_and_correction [2024/11/12 07:33] (current) – [How Hamming Codes Work] knehez
@@ Line 56: / Line 56: @@
 For example, in an 11-bit data block, we might have 4 parity bits, making it a 15-bit Hamming code.
-  * Detecting Errors: After transmission, the parity bits are recalculated and compared with the received parity bits. If there is any mismatch, the system can determine which bit is incorrect by checking the positions covered by the erroneous parity bits.
+  * **Detecting Errors**: After transmission, the parity bits are recalculated and compared with the received parity bits. If there is any mismatch, the system can determine which bit is incorrect by checking the positions covered by the erroneous parity bits.
-  * Correcting Errors: If a single-bit error is detected, the Hamming code identifies which bit is incorrect (from the parity bits' positions) and corrects it by flipping the bit.
+  * **Correcting Errors**: If a single-bit error is detected, the Hamming code identifies which bit is incorrect (from the parity bits' positions) and corrects it by flipping the bit.
 ==== Example ====