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

IEICE Technical Report; IEICE Tech. Rep.

A Decoding Algorithm for q-ary Turbo Codes by Deleting Trellis Branches

Yu Hasegawa, Gou Hosoya, Hideki Yagi, Hirasawa Shigeichi

Published Jul 14, 2005• 1 citation
OpenAlex

Related papers

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

Shu Lin, Tadao Kasami, Toru Fujiwara +1 more

Springer eBooks•Jan 1, 1998•113 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

Code Construction of Turbo Codes and LDPC Codes : from the Viewpoint of Repetitive Decoding Algorithm

Kazuhiko Yamaguchi

Proceedings of the Society Conference of IEICE•Sep 10, 2003•0 citations

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; The Map and Related Decoding Algirithms

Shu Wen Lin, M.P.C. Fossorier

•Apr 20, 1998•0 citations

Some properties of Homogenous Trellis-Constrained Codes

Christian Franck, Uli Sorger

We consider Homogenous Trellis-Constrained Codes (HTCC), a generalization of Turbo-codes where all bits are constrained. No efficient decoding algorithm is known for these codes, so our results are primarily of theoretical interest. We propose a technique to derive an upper bound for the maximum-likelihood (ML) decoding of BSC errors. Our technique is based on the weight distributions of the constituent codes and it can also be used when a specific number of errors e is known. We observe that with an ML-decoder some HTCC codes exhibit an error correcting performance close to that of random codes. For those codes we also observe a significant performance gap between ML-decoding and practical decoding based on belief-propagation.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 1, 2016•0 citations

Decoding turbo-like codes via linear programming

Jon Feldman, David Ron Karger

Journal of Computer and System Sciences•Feb 5, 2004•39 citations
We consider Homogenous Trellis-Constrained Codes (HTCC), a generalization of Turbo-codes where all bits are constrained. No efficient decoding algorithm is known for these codes, so our results are primarily of theoretical interest. We propose a technique to derive an upper bound for the maximum-likelihood (ML) decoding of BSC errors. Our technique is based on the weight distributions of the constituent codes and it can also be used when a specific number of errors e is known. We observe that with an ML-decoder some HTCC codes exhibit an error correcting performance close to that of random codes. For those codes we also observe a significant performance gap between ML-decoding and practical decoding based on belief-propagation.