Soft maximum likelihood decoding of partial unit memory codes

MaRDI QIDQ3362486zbMATH OpenFDO

Authors V. R. Sidorenko, V. V. Zyablov

Publication date 1992

zbMATH Keywords

convolutional codesdecoding complexitymaximum likelihood soft decision decodingViterbi's algorithm

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Two-step trellis decoding of partial unit memory convolutional codes
• Low-complexity decoding of partial unit memory codes on precoded partial-response channels
• Publication:4886139
• On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
• An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder

Cited in

(13)

• On Viterbi-like algorithms and their application to Reed-Muller codes
• A rate-k/n heuristic soft-output Viterbi algorithm (SOVA) that is postdetector-compatible
• scientific article; zbMATH DE number 3878842 (Why is no real title available?)
• scientific article; zbMATH DE number 3880586 (Why is no real title available?)
• BEAST Decoding of Block Codes Obtained Via Convolutional Codes
• On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
• A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
• Two-step trellis decoding of partial unit memory convolutional codes
• Low-complexity decoding of partial unit memory codes on precoded partial-response channels
• Ellipsoidal lists and maximum-likelihood decoding
• Soft-decision decoding using punctured codes
• Soft decoding for vector quantization over noisy channels with memory
• scientific article; zbMATH DE number 910962 (Why is no real title available?)

This page was built for publication: Soft maximum likelihood decoding of partial unit memory codes

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