@inproceedings{b16a7e0958874fbd9012cfb849e4dcb4,
title = "Message-passing decoding beyond the girth with local-optimality guarantees",
abstract = "We present a new message-passing iterative decoding algorithm, called normalized weighted min-sum (NWMS). NWMS-decoding is a BP-type algorithm that applies to any irregular Tanner code with single parity-check local codes (e. g. , LDPC codes and HDPC codes). The decoding guarantee of NWMS applies whenever there exists a locally optimal codeword. We prove that if a locally-optimal codeword with respect to height parameter h exists, then NWMS-decoding finds it in h iterations. This decoding guarantee holds for every finite value of h and is not limited by the girth. Because local optimality of a codeword implies that it is the unique ML-codeword, the decoding guarantee also has an ML-certificate.",
author = "Nissim Halabi and Guy Even",
year = "2012",
doi = "10.1109/EEEI.2012.6376924",
language = "الإنجليزيّة",
isbn = "9781467346801",
series = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012",
booktitle = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012",
note = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012 ; Conference date: 14-11-2012 Through 17-11-2012",
}