Decoding turbo-like codes via linear programming
From MaRDI portal
Publication:598251
DOI10.1016/j.jcss.2003.11.005zbMath1061.94072OpenAlexW2114364830MaRDI QIDQ598251
Publication date: 6 August 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2003.11.005
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decoding turbo-like codes via linear programming
- Constructions for cubic graphs with large girth
- Using Linear Programming to Decode Binary Linear Codes
- Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- The capacity of low-density parity-check codes under message-passing decoding
- Design of capacity-approaching irregular low-density parity-check codes
- Convolutional codes II. Maximum-likelihood decoding
- The Minimum Distance of Turbo-Like Codes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
This page was built for publication: Decoding turbo-like codes via linear programming