Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
From MaRDI portal
Publication:5271837
DOI10.1109/TIT.2012.2191697zbMath1365.94592arXiv1107.3715MaRDI QIDQ5271837
Akın Tanatmis, Michael Helmling, Stefan Ruzika
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.3715
Related Items (3)
On the complexity of and solutions to the minimum stopping and trapping set problems ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
This page was built for publication: Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms