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

Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation

Joakim Grahl Knudsen, Constanza Riera, Matthew Geoffrey Parker, Eirik Rosnes

Published Aug 25, 2008• 3 citations
Publisher
DOI
10.1007/978-3-540-87448-5_10

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

Reliability-Based Soft-Decision Decoding with Iterative Information Set Reduction

M.P.C. Fossorier

Electronic Notes in Discrete Mathematics•Apr 1, 2001•0 citations

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

Tadao Kasami

Lecture notes in computer science•Jan 1, 1999•8 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

Improved adaptive belief propagation decoding using edge-local complementation

Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen +2 more

This work is an extension of our previous work on an iterative soft-decision decoder for high-density parity-check codes, using a graph-local operation known as edge-local complementation (ELC). Inferred least reliable codeword positions are targeted by an ELC stage in between sum-product algorithm iterations. A gain is shown over related iterative decoding algorithms - mainly due to an improved heuristic to determine optimum ELC locations in the Tanner graph - both in error-rate performance, as well as complexity in terms of a significant reduction in the required number of ELC operations. We also present a novel damping operation, generalized to the graph-local setting where extrinsic information remains on edges not affected by ELC.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•2 citations
This work is an extension of our previous work on an iterative soft-decision decoder for high-density parity-check codes, using a graph-local operation known as edge-local complementation (ELC). Inferred least reliable codeword positions are targeted by an ELC stage in between sum-product algorithm iterations. A gain is shown over related iterative decoding algorithms - mainly due to an improved heuristic to determine optimum ELC locations in the Tanner graph - both in error-rate performance, as well as complexity in terms of a significant reduction in the required number of ELC operations. We also present a novel damping operation, generalized to the graph-local setting where extrinsic information remains on edges not affected by ELC.