PUZZLE #2656: LDPC Decoding (diff 3)

ldpc learn difficulty: 3/7 compute author: system unsolved audits passed

A 10-block LDPC-coded message (10,5) sparse code. 30 bits flipped by noise. Use iterative bit-flipping on the Tanner graph to recover the data.

DATA

Encoded	`1100011000000110011111110010010100110101001000110000101110100000000101100100111011111011010001001001`
H	`[1, 1, 0, 1, 0, 1, 0, 0, 0, 0], [0, 1, 1, 0, 1, 0, 1, 0, 0, 0], [0, 0, 1, 1, 0, 1, 0, 1, 0, 0], [0, 0, 0, 0, 1, 0, 1, 1, 1, 0], [1, 0, 0, 0, 0, 0, 0, 1, 0, 1]`
N Variable	`10`
N Check	`5`
Data Bits	`5`
N Blocks	`10`
Adj List	`[0, 4], [0, 1], [1, 2], [0, 2], [1, 3], [0, 2], [1, 3], [2, 3, 4], [3], [4]`
Check Adj	`[0, 1, 3, 5], [1, 2, 4, 6], [2, 3, 5, 7], [4, 6, 7, 8], [0, 7, 9]`
Errors	`30`
Hint	`Run bit-flipping: initialize with noisy codeword. For each check node, compute if its parity equation is satisfied. For each variable node, count connected check nodes that are violated. Flip any variable bit where > half its checks are violated. Repeat until all checks pass or 50 iterationsFirst 5 bits of each block are the data bits.`
Answer Format	`lowercase letters, no spaces or punctuation`

{
  "type": "ldpc",
  "encoded": "1100011000000110011111110010010100110101001000110000101110100000000101100100111011111011010001001001",
  "H": [
    [
      1,
      1,
      0,
      1,
      0,
      1,
      0,
      0,
      0,
      0
    ],
    [
      0,
      1,
      1,
      0,
      1,
      0,
      1,
      0,
      0,
      0
    ],
    [
      0,
      0,
      1,
      1,
      0,
      1,
      0,
      1,
      0,
      0
    ],
    [
      0,
      0,
      0,
      0,
      1,
      0,
      1,
      1,
      1,
      0
    ],
    [
      1,
      0,
      0,
      0,
      0,
      0,
      0,
      1,
      0,
      1
    ]
  ],
  "n_variable": 10,
  "n_check": 5,
  "data_bits": 5,
  "n_blocks": 10,
  "adj_list": [
    [
      0,
      4
    ],
    [
      0,
      1
    ],
    [
      1,
      2
    ],
    [
      0,
      2
    ],
    [
      1,
      3
    ],
    [
      0,
      2
    ],
    [
      1,
      3
    ],
    [
      2,
      3,
      4
    ],
    [
      3
    ],
    [
      4
    ]
  ],
  "check_adj": [
    [
      0,
      1,
      3,
      5
    ],
    [
      1,
      2,
      4,
      6
    ],
    [
      2,
      3,
      5,
      7
    ],
    [
      4,
      6,
      7,
      8
    ],
    [
      0,
      7,
      9
    ]
  ],
  "errors": 30,
  "hint": "Run bit-flipping: initialize with noisy codeword. For each check node, compute if its parity equation is satisfied. For each variable node, count connected check nodes that are violated. Flip any variable bit where > half its checks are violated. Repeat until all checks pass or 50 iterationsFirst 5 bits of each block are the data bits.",
  "answer_format": "lowercase letters, no spaces or punctuation"
}

author's note: Audited: ldpc diff 3