Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods
From MaRDI portal
Publication:4701232
Recommendations
- Bounds on the bit error probability of a linear cyclic code over GF(2/sup l/) and its extended code
- scientific article; zbMATH DE number 493101
- On maximum likelihood soft-decision decoding of binary linear codes
- An Algorithm for Calculating the Exact Bit Error Probability of a Binary Linear Code Over the Binary Symmetric Channel
- Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
Cited in
(9)- scientific article; zbMATH DE number 6908238 (Why is no real title available?)
- scientific article; zbMATH DE number 1182521 (Why is no real title available?)
- scientific article; zbMATH DE number 78004 (Why is no real title available?)
- A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
- New approach to estimation of the decoding error probability
- Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations
- An Algorithm for Calculating the Exact Bit Error Probability of a Binary Linear Code Over the Binary Symmetric Channel
- Upper bound on the bit error probability of systematic binary linear codes via their weight spectra
- Bounds on the bit error probability of a linear cyclic code over GF(2/sup l/) and its extended code
This page was built for publication: Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701232)