An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
From MaRDI portal
Recommendations
- Correction to “An Efficient Maximum-Likelihood-Decoding Algorithm for Linear Block Codes With Algebraic Decoder” [Mar 94 320-327]
- A New Decoding Algorithm for Complete Decoding of Linear Block Codes
- Efficient maximum likelihood decoding of linear block codes using a trellis
- A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
- A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient
- A Statistical Decoding Algorithm for General Linear Block Codes
- An efficient decoding algorithm for block turbo codes
- A New Linear Programming Approach to Decoding Linear Block Codes
- A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
- scientific article; zbMATH DE number 1284126
Cited in
(10)- MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
- Soft maximum likelihood decoding of partial unit memory codes
- Soft-decision decoding using punctured codes
- scientific article; zbMATH DE number 493101 (Why is no real title available?)
- scientific article; zbMATH DE number 4112537 (Why is no real title available?)
- Sort-and-match algorithm for soft-decision decoding
- Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations
- Soft decoding of short/medium length codes using ordered statistics for quantum key distribution
- On maximum likelihood soft-decision decoding of binary linear codes
- An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes
This page was built for publication: An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308768)