scientific article; zbMATH DE number 1714662

MaRDI QIDQ2776533zbMATH OpenFDO

Authors Gilles Zémor

Publication date 28 February 2002

zbMATH Keywords

binary symmetric channelcycle codes of graphserasure channelerror probabilityiterative decodingthreshold probabilities

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graph theory (including graph drawing) in computer science (68R10) Decoding (94B35) Error probability in coding theory (94B70)

Recommendations

• Algebraic coding for iterative decoding
• An analysis of the block error probability performance of iterative decoding
• Iterative decoding of LDPC codes: some bounds and properties
• Mathematical analysis of an iterative decoding algorithm for low-density codes
• Iterative decoding of binary block and convolutional codes

Cited in

(14)

• Pseudocodeword-free criterion for codes with cycle-free Tanner graph
• scientific article; zbMATH DE number 1714650 (Why is no real title available?)
• Algebraic coding for iterative decoding
• The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs
• On the Error-Correcting Capabilities of Cycle Codes of Graphs
• Codes on graphs: constraint complexity of cycle-free realizations of linear codes
• Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach
• Signal-space characterization of iterative decoding
• The distribution of loop lengths in graphical models for turbo decoding
• scientific article; zbMATH DE number 1424165 (Why is no real title available?)
• Conditionally Cycle-Free Graphical Models for Coset Codes
• Graph-Based Decoding in the Presence of ISI
• On Congruent Domination Number of Disjoint and One Point Union of Graphs
• Mathematical analysis of an iterative decoding algorithm for low-density codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776533)