A New Linear Programming Approach to Decoding Linear Block Codes
From MaRDI portal
Publication:3604646
DOI10.1109/TIT.2007.915712zbMATH Open1234.94088OpenAlexW2170915934MaRDI QIDQ3604646FDOQ3604646
Authors: Kai Yang, Jon Feldman, Xiaodong Wang
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2007.915712
Recommendations
- A New Decoding Algorithm for Complete Decoding of Linear Block Codes
- Decoding low-dimensional linear codes by linear programming
- Linear-Programming Decoding of Nonbinary Linear Codes
- Using linear programming to decode LDPC codes
- Using Linear Programming to Decode Binary Linear Codes
- Decoding complexity of linear block codes
- Multistep linear programming approaches for decoding low-density parity-check codes
- scientific article; zbMATH DE number 4123671
- Decoding turbo-like codes via linear programming
- scientific article; zbMATH DE number 3225713
Cited In (6)
- Using linear programming to decode LDPC codes
- An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- Linear programming-based optimization of the distance spectrum of linear block codes
- Linear Programming Decoding of Spatially Coupled Codes
- Using Linear Programming to Decode Binary Linear Codes
This page was built for publication: A New Linear Programming Approach to Decoding Linear Block Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604646)