@inproceedings{2c10e2f2be894293931932f42aea118c,
title = "A proof of the hadamard transform decoding of the belief propagation algorithm for LDPCC over GF(q)",
abstract = "LDPCC belief-propagation decoding algorithm uses a bipartite graph and sends belief messages between the variable symbols and the checks in an iterative process. The message that a check sends to a variable symbol can be calculated using Hadamard transform, as introduced in. However, the explicit proof of the correctness of the FHT implementation of the decoding algorithm has not been seen in the literature so far. In this paper, we give a proof for the FHT implementation of the decoding algorithm for LDPC codes over GF(q).",
keywords = "Belief-propagation algorithm, Fast hadamard transform (FHT), Low-density parity-check codes (LDPCC)",
author = "Xiangming Li and Soleymani, \{M. R.\}",
year = "2004",
doi = "10.1109/VETECF.2004.1400507",
language = "English",
isbn = "0780385217",
series = "IEEE Vehicular Technology Conference",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",
pages = "2518--2519",
booktitle = "2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall",
address = "United States",
edition = "4",
note = "60th IEEE Vehicular Technology Conference, VTC 2004-Fall ; Conference date: 26-09-2004 Through 29-09-2004",
}