scientific article; zbMATH DE number 493106

zbMATH Open0784.94026MaRDI QIDQ4276352FDOQ4276352

Authors: I. I. Dumer 

Publication date: 27 January 1994

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

linear codesmemoryless channeldecoding error probabilitysuboptimal decoding algorithms

Mathematics Subject Classification ID

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

Cited In (12)

• The (d,k) subcode of a linear block code
• On the complete decoding of binary linear codes (Corresp.)
• Decoding by local optimization (Corresp.)
• Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity
• Optimal information bit decoding of linear block codes
• Partial-optimal piecewise decoding of linear codes
• Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
• Suboptimum decoding of decomposable block codes
• On the complexity of suboptimal decoding for list and decision feedback schemes
• Decoding of low-density codes
• Decoding complexity of linear block codes
• Title not available (Why is that?)

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)