Monotonic optimization based decoding for linear codes

DOI10.1007/s10898-011-9816-9zbMath1288.90065OpenAlexW2144851713MaRDI QIDQ1941018

T. T. Son, P. T. Khoa, Hoang Tuy, Hoang Duong Tuan

Publication date: 11 March 2013

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

Full work available at URL: https://doi.org/10.1007/s10898-011-9816-9

zbMATH Keywords

global optimizationlinear codesmaximum likelihood decodinglow density parity check codes

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Boolean programming (90C09)

Related Items (1)

Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit constructions of graphs without short cycles and low density codes
• Test case generators and computational results for the maximum clique problem
• Normal sets, polyblocks, and monotonic optimization
• Recent developments and trends in global optimization
• Monotonic Optimization: Problems and Solution Approaches
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• Using Linear Programming to Decode Binary Linear Codes
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• A recursive approach to low complexity codes
• On the inherent intractability of certain coding problems (Corresp.)
• Factor graphs and the sum-product algorithm
• Good error-correcting codes based on very sparse matrices
• Discrete Monotonic Optimization with Application to a Discrete Location Problem

This page was built for publication: Monotonic optimization based decoding for linear codes