A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
From MaRDI portal
Publication:5281397
DOI10.1109/TIT.2010.2048489zbMath1366.94763arXiv0812.2559OpenAlexW2140250923MaRDI QIDQ5281397
Frank Kienle, Horst W. Hamacher, Akın Tanatmis, Mayur Punekar, Norbert Wehn, Stefan Ruzika
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2559
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Related Items (6)
On the complexity of and solutions to the minimum stopping and trapping set problems ⋮ Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems ⋮ Unnamed Item ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ A branch-cut-and-price algorithm for optimal decoding in digital communication systems ⋮ Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
This page was built for publication: A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
