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

IEEE International Symposium on Information Theory (ISIT)

A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Linear Block Code

Toshiyuki Ishida, Yuichi Kaji

Published Dec 4, 2001• 0 citations
OpenAlex

Related papers

MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure

Yuichi Kaji

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 25, 2000•7 citations

Recursive maximum-likelihood decoding algorithm for binary linear block codes

Shu Lin, Toru Fujiwara, Hiroshi Yamamoto +1 more

•Dec 1, 1997•0 citations

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; A Recursive Maximum Likelihood Decoding

Shu Wen Lin, M.P.C. Fossorier

•Apr 20, 1998•0 citations

On Recursive Maximum Likelihood Decoding algorithms for Linear Codes

Tadao Kasami

IEICE Technical Report; IEICE Tech. Rep.•Mar 15, 2001•1 citation

A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code

Toshiyuki Ishida, Yuichi Kaji

A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Dec 1, 2003•0 citations

A statistical decoding algorithm for linear block codes

Ankit Goyal

•Feb 22, 2012•0 citations
A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.