Back to Search
Start Over
Hierarchies of Local-Optimality Characterizations in Decoding of Tanner Codes
- Publication Year :
- 2012
-
Abstract
- Recent developments in decoding of 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\cdot h$ iterations, for every integer $k$.<br />Comment: Extended abstract appears in the proceedings of the IEEE International Symposium on Information Theory, Cambridge, MA,USA, 2012
- Subjects :
- Computer Science - Information Theory
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1202.2251
- Document Type :
- Working Paper