Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)

DOI10.1109/TIT.1986.1057216zbMATH Open0619.94017MaRDI QIDQ3757829FDOQ3757829

Authors: Martin Bossert, Ferdinand B. Hergert 

Publication date: 1986

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3963726
• scientific article
• scientific article; zbMATH DE number 2077096
• Generalization of chase algorithms for soft decision decoding of binary linear codes
• How often is hard-decision decoding enough?

zbMATH Keywords

soft-decision decodingdecoding algorithm for linear codes

Mathematics Subject Classification ID

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

Cited In (8)

• Two decoding algorithms for linear codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Soft Distance Metric Decoding of Polar Codes
• Sort-and-match algorithm for soft-decision decoding
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

This page was built for publication: Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)

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