On two probabilistic decoding algorithms for binary linear codes
From MaRDI portal
Recommendations
- Two decoding algorithms for linear codes
- On the probability of incorrect decoding for linear codes
- On the complete decoding of binary linear codes (Corresp.)
- scientific article; zbMATH DE number 4150087
- On maximum likelihood soft-decision decoding of binary linear codes
- scientific article; zbMATH DE number 2077096
- scientific article; zbMATH DE number 4077130
- Probabilistic decoding of nonbinary majority decodable codes
Cited in
(11)- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- On the probability of incorrect decoding for linear codes
- Discrete optimisation and fast correlation attacks
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- scientific article; zbMATH DE number 4077130 (Why is no real title available?)
- scientific article; zbMATH DE number 2077096 (Why is no real title available?)
- scientific article; zbMATH DE number 1420952 (Why is no real title available?)
- scientific article; zbMATH DE number 1714653 (Why is no real title available?)
- Complementary reliability-based decodings of binary linear block codes
- Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input
- scientific article; zbMATH DE number 4189649 (Why is no real title available?)
This page was built for publication: On two probabilistic decoding algorithms for binary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987473)
