A branch-cut-and-price algorithm for optimal decoding in digital communication systems

DOI10.1007/s10898-021-01073-4zbMath1481.90225OpenAlexW3199848899MaRDI QIDQ2052394

Banu Kabakulak, Ali Emre Pusane, Z. Caner Taşkın

Publication date: 26 November 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01073-4

zbMATH Keywords

integer programmingtelecommunicationsbranch-cut-and-price algorithmLDPC decoding

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes
• Using Linear Programming to Decode Binary Linear Codes
• An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
• A New Linear Programming Approach to Decoding Linear Block Codes
• A recursive approach to low complexity codes
• On the inherent intractability of certain coding problems (Corresp.)
• Factor graphs and the sum-product algorithm
• The capacity of low-density parity-check codes under message-passing decoding
• Good error-correcting codes based on very sparse matrices
• Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
• Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
• Error Correction Coding
• A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
• Selected Topics in Column Generation
• Decomposition Methods for Large Scale LP Decoding