scientific article; zbMATH DE number 493106

MaRDI QIDQ4276352zbMATH OpenFDO

Authors I. I. Dumer

Publication date 27 January 1994

zbMATH Keywords

decoding error probabilitylinear codesmemoryless channelsuboptimal decoding algorithms

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Suboptimal decoding of linear codes: partition technique
• On the complete decoding of binary linear codes (Corresp.)
• Decoding by local optimization (Corresp.)
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Optimal information bit decoding of linear block codes

Cited in

(15)

• Decoding of low-density codes
• Decoding complexity of linear block codes
• On the complexity of suboptimal decoding for list and decision feedback schemes
• Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity
• Suboptimal decoding of linear codes: partition technique
• Decoding by local optimization (Corresp.)
• On the complete decoding of binary linear codes (Corresp.)
• The (d,k) subcode of a linear block code
• Partial-optimal piecewise decoding of linear codes
• Suboptimum decoding of decomposable block codes
• scientific article; zbMATH DE number 1498801 (Why is no real title available?)
• On the complexity of minimum distance decoding of long linear codes
• Optimal information bit decoding of linear block codes
• scientific article; zbMATH DE number 3412515 (Why is no real title available?)
• Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial

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 Q4276352)