Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6284008 | 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) |
Keywords | DocType | Volume |
vectors,convergence,vegetation,graph theory | Journal | abs/1202.2251 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nissim Halabi | 1 | 8 | 3.58 |
| Guy Even | 2 | 1194 | 136.90 |