Decoding low-dimensional linear codes by linear programming

MaRDI QIDQ3652873zbMATH OpenFDO

Authors Truong Nguyen-Ba, Ryuichi Ashino, Rémi Vaillancourt

Publication date 16 December 2009

Mathematics Subject Classification ID

Convex programming (90C25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Arithmetic codes (94B40)

Recommendations

• Low-dimensional linear codes with high breakdown points by QR decomposition
• Decoding by Linear Programming
• Phase transitions in error correcting and compressed sensing by \(\ell _{1}\) linear programming
• Using Linear Programming to Decode Binary Linear Codes
• Publication:4945024

Cited in

(13)

• Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
• Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
• Efficient Implementation of Linear Programming Decoding
• Analog Product Codes Decodable by Linear Programming
• A search algorithm for linear codes: Progressive dimension growth
• Low-dimensional linear codes with high breakdown points by QR decomposition
• Decoding of low-density codes
• Constellation labeling for linear encoders
• Monotonic optimization based decoding for linear codes
• Linear Programming Decoding of Spatially Coupled Codes
• Phase transitions in error correcting and compressed sensing by \(\ell _{1}\) linear programming
• Linear Programming Approximations for Index Coding
• A New Linear Programming Approach to Decoding Linear Block Codes

This page was built for publication: Decoding low-dimensional linear codes by linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652873)