Hamming Code Pros: Overhead of only O(log(n)) bits
{"Image DocumentName": "Hamming Code Pros: Overhead of only O(log(n)) bits", "Image ImageDescription": "4 data bits -> 3 parity bits (57%) 248 data bits -> 8 parity bits (97%) Good for large chunks of memory (DRAM) Cons: More complicated to implement detection logic than simple parity bit.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}