scientific article; zbMATH DE number 177859
From MaRDI portal
Publication:4038738
Recommendations
- Fast decoding algorithms for first order Reed-Muller and related codes
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- scientific article; zbMATH DE number 4164732
- scientific article; zbMATH DE number 4172911
- scientific article; zbMATH DE number 57521
Cited in
(7)- Fast decoding of non-binary first order Reed-Muller codes
- Fast tabular decoding method for multi-delimiter codes
- scientific article; zbMATH DE number 4164732 (Why is no real title available?)
- One-step completely orthogonalisable UEP codes and their soft decision decoding
- Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols
- Fast Essentially Maximum Likelihood Decoding of the Golden Code
- Simple Codes and Sparse Recovery with Fast Decoding
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 Q4038738)
