TY - GEN
T1 - Hierarchies of local-optimality characterizations in decoding Tanner codes
AU - Halabi, Nissim
AU - Even, Guy
PY - 2012
Y1 - 2012
N2 - Recent developments in decoding Tanner codes with maximum-likelihood certificates are based on a sufficient condition called local optimality. We define hierarchies of locally optimal codewords with respect to two parameters. One parameter is related to the minimum distance of the local codes in Tanner codes. The second parameter is related to the finite number of iterations used in iterative decoding. We show that these hierarchies satisfy inclusion properties as these parameters are increased. In particular, this implies that a codeword that is decoded with a certificate using an iterative decoder after h iterations is decoded with a certificate after k·h iterations, for every integer k.
AB - Recent developments in decoding Tanner codes with maximum-likelihood certificates are based on a sufficient condition called local optimality. We define hierarchies of locally optimal codewords with respect to two parameters. One parameter is related to the minimum distance of the local codes in Tanner codes. The second parameter is related to the finite number of iterations used in iterative decoding. We show that these hierarchies satisfy inclusion properties as these parameters are increased. In particular, this implies that a codeword that is decoded with a certificate using an iterative decoder after h iterations is decoded with a certificate after k·h iterations, for every integer k.
UR - http://www.scopus.com/inward/record.url?scp=84867498208&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2012.6284008
DO - 10.1109/ISIT.2012.6284008
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84867498208
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2691
EP - 2695
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -