Majority-logic decoding of generalized Reed-Muller codes
From MaRDI portal
Recommendations
Cited in
(22)- Redundancies of correction capability optimized Reed-Muller codes
- On one modification of the majority decoding algorithm
- On the majority decodable distance of codes in filtrations of characteristic \(p>0\)
- Decoding binary R(2,5) by hand
- Fast decoding of non-binary first order Reed-Muller codes
- A new class of majority-logic decodable codes derived from polarity designs
- scientific article; zbMATH DE number 4145823 (Why is no real title available?)
- scientific article; zbMATH DE number 4077130 (Why is no real title available?)
- scientific article; zbMATH DE number 3478750 (Why is no real title available?)
- scientific article; zbMATH DE number 3485622 (Why is no real title available?)
- Threshold Decoding
- scientific article; zbMATH DE number 3557652 (Why is no real title available?)
- scientific article; zbMATH DE number 721914 (Why is no real title available?)
- scientific article; zbMATH DE number 1043876 (Why is no real title available?)
- Soft-decision majority decoding of Reed-Muller codes
- Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps
- A graph-theoretical method for decoding some group MLD-codes
- scientific article; zbMATH DE number 6263253 (Why is no real title available?)
- Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns
- scientific article; zbMATH DE number 3272067 (Why is no real title available?)
- On the Lin-Weldon majority-logic decoding algorithm for product codes (Corresp.)
- On majority-logic-decodable arithmetic codes
This page was built for publication: Majority-logic decoding of generalized Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640577)
