Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms

Tadao Kasami

Published Jan 1, 1999• 8 citations
Publisher
DOI
10.1007/3-540-46796-3_5

Related papers

An Iterative Soft-Decision Decoding Algorithm

Takuya Koumoto

•Mar 22, 1996•0 citations

A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search

Jun Asatani, Ken‐ichi Tomita, Takuya Koumoto +2 more

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 12, 2002•2 citations

Optimality and Ruling-Out Conditions and Their Evaluation Methods for Soft-Decision Iterative Decoding Algorithms for Binary Linear Block Codes

元生 唐

•Mar 24, 2000•0 citations

Selection Method of Search Centers in Iterative Soft-decision Decoding Algorithms for Non Binary Codes (情報通信基礎サブソサイエティ合同研究会)

仁 得重, I. Hisadomi, 忠雄 嵩

IEICE Technical Report; IEICE Tech. Rep.•Mar 19, 2002•0 citations

Decoding Binary Linear Block Codes Using Local Search

Morteza Esmaeili, A. Alampour, Thomas Aaron Gulliver

This paper presents a novel iterative hard decision decoding algorithm for binary linear block codes over a binary symmetric channel (BSC). The problem is formulated as a 0-1 integer programming problem which is known to be NP-hard. When the crossover probability c of the channel is known, the solution space of the decoding problem can be decreased to a sphere whose radius is related to c. Using the penalty function method, the problem is reformulated on this reduced solution space. Then an iterative multi-flip local search algorithm is designed to find the global solution of this decoding problem. For a code with minimum distance d, when the radius of the sphere is not greater than d-1/2, this algorithm has the maximum likelihood (ML) certificate property, i.e., if the decoder outputs a codeword, it is guaranteed to be the ML codeword. Compared to the probabilistic suboptimal iterative belief propagation (BP) decoder, this approach has lower complexity and better performance. Numerical results show that in terms of speed and performance the proposed decoding method outperforms BP decoding in the error floor region.

IEEE Transactions on Communications•Jun 1, 2013•6 citations

On a soft-input and output iterative decoding algorithm for Reed-Solomon codes

Hitoshi Tokushige, 研一 有本, Masami Mohri +1 more

IEICE Technical Report; IEICE Tech. Rep.•Mar 9, 2007•0 citations
This paper presents a novel iterative hard decision decoding algorithm for binary linear block codes over a binary symmetric channel (BSC). The problem is formulated as a 0-1 integer programming problem which is known to be NP-hard. When the crossover probability c of the channel is known, the solution space of the decoding problem can be decreased to a sphere whose radius is related to c. Using the penalty function method, the problem is reformulated on this reduced solution space. Then an iterative multi-flip local search algorithm is designed to find the global solution of this decoding problem. For a code with minimum distance d, when the radius of the sphere is not greater than d-1/2, this algorithm has the maximum likelihood (ML) certificate property, i.e., if the decoder outputs a codeword, it is guaranteed to be the ML codeword. Compared to the probabilistic suboptimal iterative belief propagation (BP) decoder, this approach has lower complexity and better performance. Numerical results show that in terms of speed and performance the proposed decoding method outperforms BP decoding in the error floor region.