A branch-cut-and-price algorithm for optimal decoding in digital communication systems
From MaRDI portal
Publication:2052394
Recommendations
- LDPC codes: A group algebra formulation
- scientific article; zbMATH DE number 1504650
- Multistep linear programming approaches for decoding low-density parity-check codes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Using Linear Programming to Decode Binary Linear Codes
Cites work
- A New Linear Programming Approach to Decoding Linear Block Codes
- A recursive approach to low complexity codes
- A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
- Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes
- An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
- Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
- Decomposition Methods for Large Scale LP Decoding
- Engine scheduling by column generation
- Error correction coding. Mathematical methods and algorithms
- Factor graphs and the sum-product algorithm
- Good error-correcting codes based on very sparse matrices
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
- On the inherent intractability of certain coding problems (Corresp.)
- Selected Topics in Column Generation
- The capacity of low-density parity-check codes under message-passing decoding
- Using Linear Programming to Decode Binary Linear Codes
Cited in
(2)
This page was built for publication: A branch-cut-and-price algorithm for optimal decoding in digital communication systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052394)
