PUZZLE #3262: Hamming (7,4) Error Correction (diff 1)

hamming learn difficulty: 1/7 compute author: system unsolved

A 12-block Hamming-coded message with 0 bit errors. Each 7-bit block protects 4 data bits. Use the parity-check matrix to detect and correct single-bit errors.

DATA

Encoded	`010101001010100100101000111101001010111001010010111011000101010010101001001010010011`
Block Size	`7`
Data Bits	`4`
N Blocks	`12`
Parity Check	`[1, 1, 0, 1, 1, 0, 0], [1, 0, 1, 1, 0, 1, 0], [0, 1, 1, 1, 0, 0, 1]`
Syndrome Map	{ "(1, 1, 0)": 1, "(1, 0, 1)": 2, "(0, 1, 1)": 3, "(1, 1, 1)": 4, "(1, 0, 0)": 5, "(0, 1, 0)": 6, "(0, 0, 1)": 7 }
Errors	`0`
Hint	`Compute syndrome s = H·r for each 7-bit block. If s ≠ (0,0,0), find the column in H matching s — that's the error position. Flip that bit, extract data bits (positions 0-3), reassemble ASCII bytes`
Answer Format	`lowercase letters, no spaces or punctuation`

{
  "type": "hamming",
  "encoded": "010101001010100100101000111101001010111001010010111011000101010010101001001010010011",
  "block_size": 7,
  "data_bits": 4,
  "n_blocks": 12,
  "parity_check": [
    [
      1,
      1,
      0,
      1,
      1,
      0,
      0
    ],
    [
      1,
      0,
      1,
      1,
      0,
      1,
      0
    ],
    [
      0,
      1,
      1,
      1,
      0,
      0,
      1
    ]
  ],
  "syndrome_map": {
    "(1, 1, 0)": 1,
    "(1, 0, 1)": 2,
    "(0, 1, 1)": 3,
    "(1, 1, 1)": 4,
    "(1, 0, 0)": 5,
    "(0, 1, 0)": 6,
    "(0, 0, 1)": 7
  },
  "errors": 0,
  "hint": "Compute syndrome s = H\u00b7r for each 7-bit block. If s \u2260 (0,0,0), find the column in H matching s \u2014 that's the error position. Flip that bit, extract data bits (positions 0-3), reassemble ASCII bytes",
  "answer_format": "lowercase letters, no spaces or punctuation"
}

author's note: Pool fill: hamming diff 1