scientific article; zbMATH DE number 493101
From MaRDI portal
Publication:4276344
Recommendations
- On maximum likelihood soft-decision decoding of binary linear codes
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
- A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes
- Soft trellis-based decoder for linear block codes
- An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
Cited in
(10)- Iterative maximum-likelihood trellis decoding for block codes
- Optimal soft decision block decoders based on fast Hadamard transform
- On maximum likelihood soft-decision decoding of binary linear codes
- Reliability-based code-search algorithms for maximum-likelihood decoding of block codes
- An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding
- Soft-decision decoding of binary linear block codes based on an iterative search algorithm
- How often is hard-decision decoding enough?
- Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
- scientific article; zbMATH DE number 910963 (Why is no real title available?)
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 Q4276344)
