Year | DOI | Venue |
---|---|---|
2012 | 10.1109/ISTC.2012.6325228 | Turbo Codes and Iterative Information Processing |
Keywords | Field | DocType |
graph theory,iterative decoding,linear programming,maximum likelihood decoding,polynomials,theorem proving,LP decoding,Tanner code,Tanner graph,combinatorial structure,inverse polynomial bound,iterative message passing decoding algorithm,linear programming,locally optimal codeword,maximum likelihood decoding,optimal decoding,proof technique,word error probability | Inverse,Discrete mathematics,Combinatorics,Mathematical optimization,Sequential decoding,Berlekamp–Welch algorithm,Polynomial,Code word,Decoding methods,Tanner graph,List decoding,Mathematics | Journal |
Volume | Citations | PageRank |
abs/1203.1854 | 0 | 0.34 |
References | Authors | |
3 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Nissim Halabi | 1 | 8 | 3.58 |
Guy Even | 2 | 1194 | 136.90 |